Skip to main content
SpringerLink
Log in

On equidistant binary codes of lengthn=4k+1 with distanced=2k

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

The aim of this paper is to provide a short proof of the main result (Theorem 2.12) of [3], using standard methods from the theory of combinatorial designs.

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

References

  1. A. E. Brouwer, An infinite series of symmetric designs,to appear.

  2. M. Hall, Jr.,Combinatorial Theory, Blaisdell Publ. Co., Waltham, Mass. 1967.

    MATH  Google Scholar 

  3. D. R. Stinson andG. H. J. van Rees, The equivalence of certain equidistant binary codes and symmetric BIBDs,Combinatorica 4 (1984), 357–362.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Comp. Sci., University of Technology, Den Dolech 2, P.O.B. 513, 5600 MB, Eindhoven, The Netherlands

    J. H. van Lint

Authors
  1. J. H. van Lint
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper was submitted to Combinatorica at the request of the editors.

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Lint, J.H. On equidistant binary codes of lengthn=4k+1 with distanced=2k . Combinatorica 4, 321–323 (1984). https://doi.org/10.1007/BF02579143

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation