Live briefing
Everything about 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 in 1966 by Dave Forney as a solution to the problem of finding a code that has both exponentially decreasing error probability with increasing block length and polynomial-time decoding complexity. Concatenated codes became widely used in space communications in the 1970s. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Concatenated error correction codeA 5-minute orientation
- Skim a recent paper: Concatenated dual displacement code for continuous-variable quantum error correctionInfluential work since 2022
- Pick up a classic book: Error control techniques for satellite and space communicationsThe most-reprinted book on the subject
- Read the landmark paper: Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error CorrectionCited 50 times
- Go sideways: Justesen codeA closely related topic
- Go sideways: Binary symmetric channelA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
Experimental Implementation of a Concatenated Quantum Error-Correcting Code
Concatenated Forward Error Correction With KP4 and Single Parity Check Codes
Improving the Tradeoff Between Error Correction and Detection of Concatenated Polar Codes
Forward error correction concatenated code in DWDM systems
A double serial concatenated code using CRC-aided error correction for highly reliable communication
Soft Information Single Error Correction for Interactive Concatenated Codes
Study on Error Correction Capability of Simple Concatenated Polar Codes
🆕 Influential since 2022
đź“š Books worth reading
- 📕Error control techniques for satellite and space communicationsDaniel J. Costello · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Justesen code In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant alphabet…
- Binary symmetric channel A binary symmetric channel (or BSCp) is a common communications channel model used in coding theory and information theory. In this model, a transmitter…
- 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…
- 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…
- 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…
- List decoding 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…
- Convolutional code In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial…
- Decoding methods In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping…