AbstractThe aim of this paper is to extend some basic concepts related to the MaximumLikelihood decoding of codes on the Z-channel, which is a particular, but very important,example of an asymmetric channel. We study distance properties of linear codes overthe Z-channel, in order to de ne a suitable metric for the implementation of a MaximumLikelihood decoder on the channel. A combinatorial expression for an upper bound on theprobability of incorrect Maximum Likelihood decoding is also provided, and comparisonsare given to evaluate the tightness of the bound, when a Hamming code, a Turbo codeand an LDPC code are decoded on the asymmetric channel. 1 Introduction Errors induced by communications on a noisy channel or storage medium can be reduced to anydesired level by proper encoding of the information, as long as the information rate is less thanthe capacity of the channel. This fact was shown in a landmark paper by Shannon, in 1948 [1];since that time, much work has been devoted to the problem of devising ecient encoding anddecoding methods for error control in a noisy environment.In a block-coded system, the source output u represents a k-bit message, the encoder outputc represents an n-symbol codeword, the demodulator output r represents the correspondingbinary received n-tuple and the decoder output u^ represents the k-bit estimate of the encodedmessage. The decoder must produce an estimate u^ of the information sequence u based onthe received sequence r. Equivalently, since there is a one-to-one correspondence between theinformation sequence u and the codeword c, the decoder can produce an estimate ^c of thecodeword c. Obviously, u^ = u if and only if ^c = c. The strategy adopted for choosing an
[1]
David J. C. MacKay,et al.
Encyclopedia of Sparse Graph Codes
,
1999
.
[2]
Sergio Benedetto,et al.
Unveiling turbo codes: some results on parallel concatenated codes
,
1995,
Proceedings of 1995 IEEE International Symposium on Information Theory.
[3]
P. Vontobel,et al.
Graph-covers and iterative decoding of nite length codes
,
2003
.
[4]
C. E. SHANNON,et al.
A mathematical theory of communication
,
1948,
MOCO.
[5]
Sergio Benedetto,et al.
Unveiling turbo codes: some results on parallel concatenated coding schemes
,
1996,
IEEE Trans. Inf. Theory.
[6]
Evangelos Eleftheriou,et al.
On the computation of the minimum distance of low-density parity-check codes
,
2004,
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[7]
Øyvind Ytrehus,et al.
Improved algorithms for the determination of turbo-code weight distributions
,
2005,
IEEE Transactions on Communications.
[8]
Paul Guinand,et al.
Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers
,
2005,
Ann. des Télécommunications.
[9]
P̊al Ellingsen,et al.
Iterative decoding for the asymmetric channel
,
2005
.
[10]
Ralf Koetter,et al.
Lower bounds on the minimum pseudoweight of linear codes
,
2004,
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..