DocumentCode
2057791
Title
Superproduct codes with improved minimum distance
Author
Tanner, R. Michael
Author_Institution
California Univ., Santa Cruz, CA, USA
fYear
2002
fDate
2002
Firstpage
283
Abstract
Superproduct codes are formed by imposing row subcode and column subcode constraints on an array of bits constituting a codeword. Carefully choosing permuted orders for the bits in each of the subcodes produces codes with almost all the desirable properties of product codes, but significantly improved minimum distance and superior decoder performance at high SNR.
Keywords
decoding; group codes; product codes; automorphism; codeword; column subcode constraints; decoder performance; group invariance; high SNR; improved minimum distance; permuted orders; product codes; quasi-cyclic codes; row subcode constraints; superproduct codes; Bipartite graph; Code standards; Equations; Error correction codes; Iterative decoding; Parity check codes; Product codes; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023555
Filename
1023555
Link To Document