Skip to main content
SpringerLink
Log in

On New Perfect Binary Nonlinear Codes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centre National de la Recherche Scientifique, Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, F-75634 Paris cédex 13, France (e-mail: lobstein@inf.enst.fr), , , , , , FR

    A. C. Lobstein

  2. Institute for Problems of Information Transmission, Russian Academy of Sciences, Bol’shoi Karetnyi, 19, GSP-4, Moscow, 101447, Russia (e-mail: zinov@ippi.ac.msk.su), , , , , , RU

    V. A. Zinoviev

Authors
  1. A. C. Lobstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Zinoviev
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Search

Navigation