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

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 ra...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2005-01, Vol.51 (1), p.120-127
Main Authors: Luby, M.G., Mitzenmacher, M.
Format: Article
Language:English
Subjects:
Applied sciences
Belief propagation
Channels
Codes
Coding, codes
Concatenated codes
Data structures
Decoding
Encoding
Error correction codes
Error probability
Errors
Exact sciences and technology
High performance computing
Information technology
Information theory
Information, signal and communications theory
Internet
Low-density parity-check (LDPC) codes
packet- based codes
Parity check codes
Probability
Random errors
Signal and communications theory
Telecommunications and information theory
verification-based decoding
White noise
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2004.839499