Computer Science – Information Theory
Scientific paper
2011-01-26
Computer Science
Information Theory
17 pages, 2 tables, 6 figures, submitted to IEEE Transactions on Information Theory
Scientific paper
The order statistics based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of the list of the test error patterns is considered. The original order statistics decoding is generalized by assuming segmentation of the most reliable independent positions of the received bits. The segmentation is shown to overcome several drawbacks of the original order statistics decoding. The complexity of the order statistics based decoding is further reduced by assuming a partial ordering of the received bits in order to avoid the complex Gauss elimination. The probability of the test error patterns in the decoding list is derived. The bit error rate performance and the decoding complexity trade-off of the proposed decoding algorithms is studied by computer simulations. Numerical examples show that, in some cases, the proposed decoding schemes are superior to the original order statistics decoding in terms of both the bit error rate performance as well as the decoding complexity.
Alnawayseh Saif E. A.
Loskot Pavel
No associations
LandOfFree
Order Statistics Based List Decoding Techniques for Linear Binary 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 Order Statistics Based List Decoding Techniques for Linear Binary Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Order Statistics Based List Decoding Techniques for Linear Binary Block Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-418763