Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes

Details Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes

2009-10-10

arxiv.org/abs/0910.1922v1

Computer Science

Information Theory

5 pages, ITW

Scientific paper

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, 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.

Affiliated with

Also associated with

No associations

Rating

Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Linear-Time Erasure Decoding for Non-Binary LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620537