Abstract
We construct three new binary perfect codesC 1,C 2 andC 3 of length 15. We show that dim(ker(C i))=i fori=1, 2 and 3. It follows that the codimension ofC 1 equals 0.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Hergert, Algebraische Methoden für nichtlineare Codes, Thesis Darmstadt (1985).
K.T. Phelps, A general product construction for error correcting codes,SIAM J. Alg. and Discrete Methods, Vol. 5 (1984), pp. 224–228.
J-E., Roos, An algebraic study of group and nongroup error-correcting codes,Inf. and Contr., Vol. 8 (1965), pp. 195–214.
F.J. Soloveva, Iterative construction of nonlinear perfect codes withd=3,Diskretnyj analiz, 37 (1981), pp. 65–76.
K.T. Phelps, A combinatorial construction of perfect codes,SIAM J. Alg. and Discrete Methods, Vol. 4 (1983), pp. 398–403.
J-M. Laborde, Une nouvelle famille de codes binaires, parfait non lineaires,C.R. Acad. Sc. Paris, Seri I (1983), pp. 67–70.
O. Heden, A new construction of group and nongroup perfect codes,Inf. and Contr., Vol. 34 (1977), pp. 314–323.
V. Zinoviev, Combinatorial properties, analysis and constructions of nonlinear block codes, Dissertation for Degree of Doctor of Physical-Mathematical Sciences, Institute for Problems of Information Transmission, Russian Academy of Sciences, (1977), Moscow.
Author information
Authors and Affiliations
Additional information
Communicated by D. Jungnickel
Rights and permissions
About this article
Cite this article
Heden, O. A binary perfect code of length 15 and codimension 0. Des Codes Crypt 4, 213–220 (1994). https://doi.org/10.1007/BF01388453
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388453