Some constructions of generalised concatenated codes based on unit memory codes
From MaRDI portal
Publication:4608517
DOI10.1007/3-540-60693-9_26zbMath1398.94242OpenAlexW1584108920MaRDI QIDQ4608517
Sergo Shavgulidze, Jørn Justesen, Victor Zyablov
Publication date: 21 March 2018
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60693-9_26
Cites Work
- Unnamed Item
- A bound on the distance of unit memory generalized convolutional concatenated codes
- A new construction of partial unit memory codes based on Reed-Solomon codes
- Bounds on distances for unit memory concatenated codes.
- Bounds on distances and error exponents of unit memory codes
- Concatenated codes with convolutional inner codes
- Bounded distance decoding of unit memory codes
- On periodic (partial) unit memory codes with maximum free distance
This page was built for publication: Some constructions of generalised concatenated codes based on unit memory codes