Live briefing
Everything about List decoding
Alternative to unique decoding in coding theory
In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. The notion was proposed by Elias in the 1950s. The main idea behind list decoding is that the decoding algorithm instead of outputting a single possible message outputs a list of possibilities one of which is correct. This allows for handling a greater number of errors than that allowed by unique decoding. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: List decodingA 5-minute orientation
- Skim a recent paper: List-GRAND: A Practical Way to Achieve Maximum Likelihood DecodingInfluential work since 2022
- Pick up a classic book: Mathematical structures for computer scienceThe most-reprinted book on the subject
- Read the landmark paper: List Decoding of Polar CodesCited 1,656 times
- Go sideways: Folded Reed–Solomon codeA closely related topic
- Go sideways: Locally decodable codeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
List Decoding of Polar Codes
List Viterbi decoding algorithms with applications
List successive cancellation decoding of polar codes
Belief Propagation List Decoding of Polar Codes
Error-correcting codes for list decoding
Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
List decoding
Combinatorial bounds for list decoding
🆕 Influential since 2022
List-GRAND: A Practical Way to Achieve Maximum Likelihood Decoding
CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime
High-Throughput Adaptive List Decoding Architecture for Polar Codes on GPU
Fast Iterative Soft-Output List Decoding of Polar Codes
A Universal List Decoding Algorithm With Application to Decoding of Polar Codes
đź“š Books worth reading
Mathematical structures for computer scienceJudith L. Gersting · 1982
Why Men Want Sex and Women Need LoveAllan Pease, Barbara Pease · 2003- 📕Diversity-Oriented SynthesisAndrea Trabocchi, Stuart L. Schreiber · 2013
Introduction to information retrievalChristopher D. Manning, Prabhakar Raghavan · 2008
Got milked?Alissa Hamilton · 2015
Data structures & algorithms in JavaRobert Lafore · 2003
Real World HaskellBryan O'Sullivan, John Goerzen · 2008
Up your score SATLarry Berger · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Folded Reed–Solomon code In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} Reed–Solomon codewords over…
- Locally decodable code A locally decodable code (LDC) is an error-correcting code that allows a single bit of the original message to be decoded with high probability by only…
- Generalized minimum-distance decoding In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using…
- Elias Bassalygo bound The Elias Bassalygo bound is a mathematical limit used in coding theory for error correction during data transmission or communications. Let C {\displaystyle…
- Reed–Solomon error correction In information theory and coding theory, Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon…
- Algebraic geometry code Algebraic geometry codes, often abbreviated AG codes, are a type of linear code that generalize Reed–Solomon codes. The Russian mathematician V. D. Goppa…
- Wozencraft ensemble In coding theory, the Wozencraft ensemble is a set of linear codes in which most of codes satisfy the Gilbert-Varshamov bound. It is named after John Wozencraft…
- Concatenated error correction code In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were conceived…