Concatenated codes
By takCH USFEs. Scholarpedia, 2009
412 citations recorded by the source corpus.
Concatenation is a method of building long codes out of shorter ones; it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. We present theoretical and computational results bearing on the efficiency and complexity of concatenated codes; the major theoretical results are the following: 1. Concatenation of an arbitrarily large number of codes can yield a probability of error that decreases exponentially with the over-all block length, while the decoding complexity increases only algebraically; and 2. Concatenation of a finite number of codes yields an error exponent that is inferior to that attainable with a single stage, but is nonzero at all rates below capacity. Computations support these theoretical results, and also give insight into the relationship between modulation and coding. This approach illuminates the special power and usefulness of the class of ReedSolomon codes. We give an original presentation of their structure and properties, from which we derive the properties of all BCH codes; we determine their weight distribution, and consider in detail the implementation of their decoding algorithm, which we have extended to correct both erasures and errors and have otherwise improved. We show that on a particularly suitable channel, RS codes can achieve the performance specified by the coding theorem. Finally, we present a generalization of the use of erasures in minimum-distance decoding, and discuss the appropriate decoding techniques, which constitute an interesting hybrid between decoding and detection.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/dd35c48954aa2cc7e555b790534e134a7b3aea7e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
Citations in the corpus
- Introduction to Property Testing (2017, neutral): “A natural way of reducing the alphabet size of codes is using the wellknown paradigm of concatenated codes [117]: A concatenated code is obtained by encoding the symbols of an “outer code” (using the coding method of the “inner code”).”
- Efficient Helper Data Key Extractor on FPGAs (2008, positive): “We find that concatenation of codes as introduced by Forney [19], allows for the use of codes that are much simpler to implement and possibly more area efficient than BCH codes.”