Skip to main content
SpringerLink
Log in

On the square-root bound for QR-codes

  • Published:
Journal of Geometry Aims and scope Submit manuscript

Abstract

The square-root bound for quadratic-residue codes of lengthn≡1 (mod 4) is improved in several cases by graph-theoretic means.

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

Literatur

  1. Assmus, E.F., Jr., H.F. Mattson, Jr.:New 5-designs. J. Combin. Theory 6 (1969), 122–151.

    Google Scholar 

  2. Coppersmith, D., G. Seroussi:On the minimum distance of some quadratic residue codes. IEEE Trans. Inform. Theory IT-30 (1984), 407–411.

    Google Scholar 

  3. Heise, W.: personal communication.

  4. Heise, W., H. Kellerer:Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n ≡ −1 mod 4. J. Inf. Process. Cybern. EHK23 (1987), 113–124.

    Google Scholar 

  5. Heise, W., H. Kellerer: Überdie Quadratwurzel-Schranke für Quadratische-Rest-Codes. this J. Geom.

  6. Klemm, M.: Überdie Wurzelschranke für das Minimalgewicht von Codes. J. Combin. Theory Ser. A36 (1984), 364–372.

    Google Scholar 

  7. McWilliams, F.J., N.J.A. Sloane:The theory of error-correcting codes I, II. North-Holland, Amsterdam 1977.

    Google Scholar 

  8. Newhart, D.W.:On minimum weight codewords in QR codes. To appear in J. Combin. Theory Ser. A.

Download references

Author information

Authors and Affiliations

  1. Karl-Weierstraß-Institut für Mathematik, Akademie der Wissenschaften der DDR, Mohrenstr. 39, PSF 1304, 1086, Berlin, DDR

    Ludwig Staiger

Authors
  1. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Helmut Karzel on the occasion of his 60th birthday

The results of this paper were presented at the Third International Workshop on Information Theory ”Convolutional Codes; Multi-User Communication”, Sochi, USSR, May 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Staiger, L. On the square-root bound for QR-codes. J Geom 31, 172–178 (1988). https://doi.org/10.1007/BF01222398

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Search

Navigation