Skip to main content
SpringerLink
Log in

On the Ranks and Kernels Problem for Perfect Codes

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

A construction is proposed which, for n large enough, allows one to build perfect binary codes of length n and rank r, with kernel of dimension k, for any admissible pair (r, k) within the limits of known bounds.

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. Sobolev Institute of Mathematics, Siberian Branch of the RAS, Novosibirsk

    S. V. Avgustinovich & F. I. Solov'eva

  2. Royal Institute of Technology, Stockholm, Sweden

    O. Heden

Authors
  1. S. V. Avgustinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. I. Solov'eva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. O. Heden
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Avgustinovich, S.V., Solov'eva, F.I. & Heden, O. On the Ranks and Kernels Problem for Perfect Codes. Problems of Information Transmission 39, 341–345 (2003). https://doi.org/10.1023/B:PRIT.0000011272.10614.8c

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:PRIT.0000011272.10614.8c

Keywords

Search

Navigation