Computer Science – Information Theory
Scientific paper
2007-08-07
Computer Science
Information Theory
40 pages, 6 figures, 10 tables, submitted to IEEE Transactions on Information Theory
Scientific paper
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterative message passing and permutation decoding. We also present bounds on the smallest number of permutations of an automorphism group decoder needed to correct any set of erasures up to a prescribed size. Simulation results demonstrate that for a large number of algebraic codes, the performance of the new decoding method is close to that of maximum likelihood decoding.
Hehn Thorsten
Huber Johannes B.
Laendner Stefan
Milenkovic Olgica
No associations
LandOfFree
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic 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 Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-170233