Skip to main content

Advertisement

Log in

Abstract.

 We present a new construction of binary nonlinear perfect codes with minimum distance 3 and lowerbound the number of nonequivalent such codes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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

Authors

Additional information

Received: November 26, 1996; revised version: March 14, 1997

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050080