Partial unit memory codes on the base of subcodes of Hadamard codes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 829)
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.
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.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.Google Scholar
- 3.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.Google Scholar
© Springer-Verlag Berlin Heidelberg 1994