LDPC codes revolutionized coding theory with significant performance improvements
Image: Wikideas1, CC0, via Wikimedia Commons
Low-density parity-check code
LDPC codes revolutionized coding theory with significant performance improvements
Low-density parity-check (LDPC) codes, also known as Gallager codes, have significantly improved coding theory since their resurgence in the mid-1990s. Originally conceived by Robert G. Gallager in 1960, these codes were largely ignored due to computational expense until improved hardware made them practical. They provided a high-performance, patent-free alternative to turbo codes, sparking a revolution in coding theory.
Example
LDPC codes are now widely used in wireless communications, such as 5G and WiFi, showcasing their adaptability and high performance.
Remember this
Understanding LDPC codes is crucial for advancing wireless communication technologies and improving data transmission reliability.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Related concepts
Error correction code
Turbo codes achieve near-Shannon-limit error correction with iterative decoding
Error detection and correction
Reed-Solomon codes correct burst errors in data transmission and storage
Huffman coding
Huffman coding is an entropy-optimal prefix code for lossless data compression
Shannon's source coding theorem: you can't compress below entropy
Can you squeeze endless text into fewer bits without losing anything?
the lottery ticket hypothesis says: sparse subnetworks can match full network performance
Can a small part of a puzzle fit perfectly into its place by chance?
Kolmogorov complexity
Kolmogorov complexity is uncomputable
Swipe through 100 ML concepts daily
Open Pocket Polymath