On the iterative decoding of binary product codes over the binary erasure channel

Author

Freitas, P.R. ; Rocha, V. C da, Jr. ; Lemos-Neto, J.S.

Author_Institution

Dept. of Electron. & Syst., Fed. Univ. of Pernambuco, Recife, Brazil

fYear

2011

fDate

6-9 Nov. 2011

Firstpage

126

Lastpage

130

Abstract

Iterative decoding in two dimensions over the binary erasure channel is investigated when identical linear binary cyclic codes are employed in each dimension. Decoding of the overall code is simplified by employing iterative decoding with cyclic permutations for the component code in each dimension. Decoding complexity versus performance can be traded as a function mainly of the number of minimum weight codewords selected from the dual of each component code. Using results from computer simulations, a comparative analysis is presented of various iterative decoding algorithms in two dimensions applied to simple codes, specifically the product codes (961,676,9), (225,49,25) and (961,256,49).

Keywords

binary codes; channel coding; cyclic codes; iterative decoding; linear codes; product codes; binary erasure channel; binary product code; comparative analysis; computer simulation; cyclic permutation; identical linear binary cyclic code; iterative decoding algorithm; minimum weight codeword; Block codes; Complexity theory; Decoding; Iterative decoding; Polynomials; Product codes; Error correcting codes; binary erasure channel; cyclic codes; two-dimensional iterative decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communication Systems (ISWCS), 2011 8th International Symposium on

Conference_Location

Aachen

ISSN

2154-0217

Print_ISBN

978-1-61284-403-9

Electronic_ISBN

2154-0217

Type

conf

DOI

10.1109/ISWCS.2011.6125323

Filename

6125323