Verification-based decoding for packet-based low-density parity-check codes

Authors:
M. G. Luby;M. Mitzenmacher
Affiliations:
Digital Fountain Inc., USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 3

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

IEEE Transactions on Information Theory
Adding integrity verification capabilities to the LDPC-staircase erasure correction codes

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance analysis of verification-based decoding for packet-based LDPC codes over binary symmetric channel

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	754.90

Visualization

Abstract

We introduce and analyze verification-based decoding for low-density parity-check (LDPC) codes, an approach specifically designed to manipulate data in packet-sized units. Verification-based decoding requires only linear time for both encoding and decoding and succeeds with high probability under random errors. We describe how to utilize code scrambling to extend our results to channels with errors controlled by an oblivious adversary.