Abstract
Various schemes of concatenated coding on the basis of unit memory codes are considered. Constructive lower bounds for the free distance and also for extended row, column and segment distances are obtained. For fixed rates of concatenated codes the reasonable range of rates of inner codes are given. Characteristics of interleaved codes are investigated. It is shown, that the generalised concatenated codes ensure better distance bounds than the ordinary concatenated codes.
Cite
CITATION STYLE
Zyablov, V., Shavgulidze, S., & Justesen, J. (1995). Some constructions of generalised concatenated codes based on unit memory codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 237–256). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
