Title :
Near-optimal codes on the two-state Markovian additive channel
Author_Institution :
Quantum Comput. & Inf. Project, Japan Sci. & Technol. Corp., Tokyo, Japan
Abstract :
Near-optimality of subcodes of the cyclic Hamming codes is established on the binary additive channel whose noise process is the two-state homogeneous Markov chain, which is a model of bursty communication channels
Keywords :
Hamming codes; Markov processes; cyclic codes; error statistics; maximum likelihood decoding; optimisation; telecommunication channels; binary additive channel; bursty communication channels; channel model; cyclic Hamming codes; decoding error probability; maximum likelihood decoding; near-optimal codes; noise process; subcodes; two-state Markovian additive channel; two-state homogeneous Markov chain; Additive noise; Communication channels; Error probability; Galois fields; Hamming distance; Linear code; Maximum likelihood decoding; Performance analysis; Quantum computing; Upper bound;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936109
