Abstract
In this paper a short description of concatenated codes with inner convolutional codes is given. The distance parameters of such codes can be estimated using the extended row and column distances of the inner and outer codes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Justesen, C. Thommesen, and V. Zyablov, ”Concatenated codes with inner convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1217–1225, Sept. 1988.
G.S.Lauer, ”Some optimal partial-unit-memory codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 240–243, Mar. 1979.
J.Justesen, ”Bounded distance decoding of unit memory codes,” IEEE Trans. Inform. Theory, vol. IT-39, pp. 1616–1627, Sept. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dettmar, U., Sorger, U.K., Zyablov, V.V. (1994). Concatenated codes with convolutional inner and outer codes. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58265-6
Online ISBN: 978-3-540-48588-9
eBook Packages: Springer Book Archive