Abstract.
We present a new construction of binary nonlinear perfect codes with minimum distance 3 and lowerbound the number of nonequivalent such codes.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: November 26, 1996; revised version: March 14, 1997
Rights and permissions
About this article
Cite this article
Lobstein, A., Zinoviev, V. On New Perfect Binary Nonlinear Codes. AAECC 8, 415–420 (1997). https://doi.org/10.1007/s002000050080
Issue Date:
DOI: https://doi.org/10.1007/s002000050080