Constructions of generalized concatenated codes and their trellis-based decoding complexity
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1182528
- scientific article; zbMATH DE number 4104870
- Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
- Generalized concatenated codes. Algebraic theory and complexity of realization.
- scientific article; zbMATH DE number 3485627
- scientific article; zbMATH DE number 1284436
- scientific article; zbMATH DE number 4077127
- On generalized concatenated constructions of perfect binary nonlinear codes
- Bounds on the weight hierarchy of generalized concatenated codes
- The trellis complexity of convolutional codes
Cited in
(12)- On the generalized concatenated construction for codes in \(L_1\) and Lee metrics
- On multi-trial Forney-Kovalev decoding of concatenated codes
- Generalized concatenated codes. Algebraic theory and complexity of realization.
- A note on performance of generalized tail biting trellis codes
- Low-complexity concatenated two-state TCM schemes with near-capacity performance
- scientific article; zbMATH DE number 4123677 (Why is no real title available?)
- Designing lexicographic codes with a given trellis complexity
- Some constructions of generalised concatenated codes based on unit memory codes
- The Preparata and Goethals codes: trellis complexity and twisted squaring constructions
- Modified generalized concatenated codes and their application to the construction and decoding of LUEP codes
- Bounds on the weight hierarchy of generalized concatenated codes
- Generalized concatenated coding and Fourier transform
This page was built for publication: Constructions of generalized concatenated codes and their trellis-based decoding complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701323)
