7 search results - page 1 / 2 » Tightened Upper Bounds on the ML Decoding Error Probability ... |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
TIT
2002
13 years 4 months ago
2002
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
TIT
2008
13 years 4 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— Communications over multiple-input multipleoutput (MIMO) channels with carrier offsets is an important practical and theoretical problem. Double-differential coding is ...