Abstract
Partial memory codes on the base of subcodes of nonlinear Hadamard codes are proposed. It is shown that they have better parameters than partial memory codes based on the linear codes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Thommesen and J. Justesen, “Bounds on Distance and Error Exponents of Unit Memory Codes,” IEEE Trans. Info. Theory, vol.IT-29, pp.637–649, 1983.
U. Dettmar, U. K. Sorger, D. N. Gevorkian, and V. V. Ziablov, “An Extension of Partial Unit Memory Codes,” Proc., The Third International Colloquium on Coding Theory, Dilijian, pp.14–17, 1990.
V. V. Ziablov, S. A. Shavgulidze, and M. G. Shanidze, “Bounds on Free Euclidean Distance for Various Systems of Modulation and Coding,” Problems of Control and Information Theory, vol.17(6), pp.345–356, 1988.
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.V., Ashikhmin, A.E. (1994). Partial unit memory codes on the base of subcodes of Hadamard 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_9
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_9
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