Title :
On structure and decoding of product codes
Author :
Miri, S.A. ; Khandani, A.K.
Author_Institution :
Dept. of Math., Toronto Univ., Ont., Canada
Abstract :
Product codes have been an effective coding method for communication channels where both random and burst error occur. We present a new approach to the structure and maximum likelihood (ML) decoding of product codes using Tanner (1981) graphs. For product codes having a sub-code which is a product of simple parity codes and repetition codes, we show how to obtain a sub-code with an acyclic Tanner graph and the largest possible distance. We show that in all cases of interest, a n-dimensional product code has such a structure. Wagner rule decoding is used on this sub-code and its cosets to obtain an effective and efficient maximum likelihood decoding of the given product code
Keywords :
binary codes; block codes; channel coding; graph theory; linear codes; maximum likelihood decoding; Golay code; Reed-Muller codes; Wagner rule decoding; acyclic Tanner graph; binary block codes; burst error; code distance; code structure; coding method; communication channels; linear block codes; maximum likelihood decoding; parity codes; product codes; random error; repetition codes; sub-code; Bipartite graph; Block codes; Communication channels; Councils; Decoding; Information technology; Mathematics; Matrix decomposition; Parity check codes; Product codes;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866376