Abstract
Given a binary code,C, of lengthn, thekernel of the code is defined to be the set of all vectors which leave the code invariant under translation. Throughout this paper, various properties of kernels will be considered. However, the main idea of this paper is to show the necessary and sufficient conditions for the existence of kernels of all possible sizes for nonlinear perfect binary codes.
Similar content being viewed by others
References
H. Bauer, B. Ganter, and F. Hergert, Algebraic technique for nonlinear codes,Combinatorica, Vol. 3 (1983).
Tuvi Etzion and Alexander Vardy, Perfect binary codes: Constructions propertites, and enumeration,IEEE Trans. on Information Theory, Vol. 40 (1994) pp. 754–763.
O. Heden, A binary perfect code of length 15 and codimension 0.Designs, Codes, and Cryptography, Vol. 4 (1994), pp. 213–220.
F. Hergert, Algebraische Methoden für nichtlineare Codes, Dissertation, Darmstadt (1985).
K. T. Phelps, A combinatorial construction of perfect codes.SIAM J. Alg. and Discrete Methods, Vol. 4 (1983) pp. 398–403.
K. T. Phelps, A general product construction for error correcting codes.SIAM J. Alg. and Discrete Methods, Vol. 5 (1984) pp. 224–228.
Author information
Authors and Affiliations
Additional information
Communicated by: R. Mullin
Rights and permissions
About this article
Cite this article
Phelps, K.T., Levan, M. Kernels of nonlinear Hamming codes. Des Codes Crypt 6, 247–257 (1995). https://doi.org/10.1007/BF01388478
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388478