Computer Science – Information Theory
Scientific paper
2007-02-08
Computer Science
Information Theory
5 pages, submitted to ISIT 2007; v2: BER/FER curves in Fig. 1 & 2 updated
Scientific paper
We investigate the stopping redundancy hierarchy of linear block codes and its connection to permutation decoding techniques. An element in the ordered list of stopping redundancy values represents the smallest number of possibly linearly dependent rows in any parity-check matrix of a code that avoids stopping sets of a given size. Redundant parity-check equations can be shown to have a similar effect on decoding performance as permuting the coordinates of the received codeword according to a selected set of automorphisms of the code. Based on this finding we develop new decoding strategies for data transmission over the binary erasure channel that combine iterative message passing and permutation decoding in order to avoid errors confined to stopping sets. We also introduce the notion of s-SAD sets, containing the smallest number of automorphisms of a code with the property that they move any set of not more than s erasures into positions that do not correspond to stopping sets within a judiciously chosen parity-check matrix.
Hehn Thorsten
Huber Johannes B.
Laendner Stefan
Milenkovic Olgica
No associations
LandOfFree
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block 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 Linear Block 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 Linear Block Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-432698