Abstract
In this paper we describe two constructions of q-ary (partial) unit memory codes that achieve upper bounds on the free distance. These constructions are based on Reed-Solomon codes. We show that the increase a of the extended row distance of the proposed codes is larger than that for known ones.
Preview
Unable to display preview. Download preview PDF.
References
C. Thommesen and J. Justesen, Bounds on distances and error exponents of unit memory codes, IEEE Trans. Inform. Theory, IT-29(5), 637–649, 1983
F. Pollara, R. J. McEliece, and K. Abdel-Ghaffar, Finite-states codes, IEEE Trans. Inform. Theory, IT-34(5), 1083–1089, 1988
V. V. Zyablov and V. R. Sidorenko, Bounds on complexity of trellis decoding of linear block codes, Problems of Information Transmission, 29(3), 3–9, Jul.–Sept., 1993 (transl. from Russian)
S. A. Popov, Synchronization of separate MDS codewords in presence of noise, Problems of Information Transmission, 21(3), 28–35, 1985 (transl. from Russian)
J. Justesen, Bounded distance decoding of unit memory codes, IEEE Trans. Inform. Theory, IT-39(5), 1616–1627, 1993
U. K. Sorger, A new construction of partial unit memory codes based on Reed-Solomon Codes, Problems of Information Transmission, submitted 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zyablov, V., Sidorenko, V. (1994). On periodic (partial) unit memory codes with maximum free distance. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_10
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