Abstract
In this note we find the exact value of K 2,3(2, 4)- the minimum number of codewords in a code C with 2 binary and 4 ternary coordinates and covering radius 1. Namely, we prove that K 2,3(2,4)=36.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.Kolev: Coverings and spectrums of codes over finite fields, Ph.D. thesis, Sofia University, November, 1993.
E.Kolev and I.Landgev: On some mixed covering codes of small length, Springer-Verlag Lecture Notes in Computer Science, vol.781, 1994, pp. 38–50.
Heikki Hämäläinen and Seppo Rankinen: Upper bound for football pool problems and mixed covering codes, J. Comb. Theory A, vol.56, No1, 1991, pp.84–95.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolev, E. (1995). Mixed covering codes with two binary and four ternary coordinates. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-60114-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60114-2
Online ISBN: 978-3-540-49440-9
eBook Packages: Springer Book Archive