Simplification of packet-symbol decoding with errors, deletions, misordering of packets, and no sequence numbers

Authors:
John J. Metzner
Affiliations:
Departments of Computer Science and Engineering and Electrical Engineering, Pennsylvania State University, University Park, PA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 11
Cited 0

Parity-based loss recovery for reliable multicast transmission

IEEE/ACM Transactions on Networking (TON)
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Convolutionally Encoded Memory Protection

IEEE Transactions on Computers
Asymptotically good codes correcting insertions, deletions, and transpositions

IEEE Transactions on Information Theory
Efficient erasure correcting codes

IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions

IEEE Transactions on Information Theory
Verification-based decoding for packet-based low-density parity-check codes

IEEE Transactions on Information Theory
Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the -ary Random Deletion Channel for Large

IEEE Transactions on Information Theory
Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking

IEEE Transactions on Information Theory
A digital fountain approach to asynchronous reliable multicast

IEEE Journal on Selected Areas in Communications
An overview of reliable multicast transport protocol II

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	754.85

Visualization

Abstract

In this paper, a new method is described which builds on Mitzenmacher's idea of adding a different pseudorandom number to each packet to help decode packet-symbol low-density codes, with deletions, errors, and out-of-order reception, without sequence numbers. The new method has lower decoding complexity than the original method. The most basic form of the new method applies to any parity-check code structure, but is limited to a rather small number of packets in the code. Decoding success is slightly inferior to an ideal erasure channel, which would require sequence numbering and error detection in each packet. Error detection is needed only for the whole code, amounting to usually less than one bit per packet symbol. Moreover, if error detection can resolve one of a small number of alternatives, the ordered case performs almost as well as the ideal erasure channel. Ways are shown to modify the basic algorithm for use with long codes, possibly approaching the erasure channel capacity limit.