Work

Binary linear-time erasure decoding for non-binary LDPC codes

Year: 2009
Type: conference-paper
Abstract: In this paper, we first introduce the extended binary representation of non-binary codes, which corresponds to a covering graph of the bipartite graph associated with the non-binary code. Then we show that non-binary codewords correspond to binary codewords of the extended representation that further satisfy some simplex-constraint: that is, bits lying over the same symbol-node of the non-binary graph must form a codeword of a simplex code. Applied to the binary erasure channel (BEC), this description leads to a binary erasure decoding algorithm of non-binary LDPC codes, whose complexity depends linearly on the cardinality of the alphabet. We also give insights into the structure of stopping sets for non-binary LDPC codes, and discuss several aspects related to upper-layer FEC applications.
Language: English
Open Access status: green
OpenAlex ID: W2104397702
FWCI: 1.418
Cites: 16
Cited by: 15
Related to: 9