Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
From MaRDI portal
Recommendations
Cited in
(24)- A new concatenated BCH-matrix type-B code
- Coding theorem for a generalized maximum likelihood decoding scheme
- On multi-trial Forney-Kovalev decoding of concatenated codes
- Iterated logarithmic expansions of the pathwise code lengths for exponential families
- A note on performance of generalized tail biting trellis codes
- Modified product codes
- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
- scientific article; zbMATH DE number 4047599 (Why is no real title available?)
- scientific article; zbMATH DE number 4104870 (Why is no real title available?)
- Concatenated codes for multiple access channels (Corresp.)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3485628 (Why is no real title available?)
- scientific article; zbMATH DE number 4123677 (Why is no real title available?)
- Generalized concatenated codes for channels where unidirectional byte errors are predominant
- Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding
- Concatenated tree codes: a low-complexity, high-performance approach
- A modified concatenated coding scheme, with applications to magnetic data storage
- Constructions of generalized concatenated codes and their trellis-based decoding complexity
- scientific article; zbMATH DE number 3995582 (Why is no real title available?)
- Constructive codes for arbitrary discrete memoryless channels
- Analysis of coding schemes for modulation and error control
- Bounds on the weight hierarchy of generalized concatenated codes
- scientific article; zbMATH DE number 3417337 (Why is no real title available?)
- Centered codes
This page was built for publication: Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893816)