Skip to main content
Log in

Über die Quadratwurzel-Schranke für Quadratische-Rest-Codes

  • Published:
Journal of Geometry Aims and scope Submit manuscript

Abstract

The minimal distanced of any QR-Code of length 3mod4 over a prime fieldGF (p) with p≡3 mod4 satisfies the improved square root bound d(3d-2)≥4(n−1).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Literatur

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

    Google Scholar 

  2. Halder, H.-R., W. Heise:Einführung in die Kombinatorik. Häuser, München 1976; Akademie, Berlin 1977.

    Google Scholar 

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

    Google Scholar 

  4. Heise, W., P. Quattrocchi:Informations und Codierungstheorie. Springer, Berlin 1983.

    Google Scholar 

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

    Google Scholar 

  6. Mcwilliams, F.J., N.J.A. Sloane:The theory of error-correcting codes. North-Holland, Amsterdam 1978.

    Google Scholar 

  7. 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

Authors

Additional information

Helmut Karzel zum 60. Geburtstag gewidmet

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heise, W., Kellerer, H. Über die Quadratwurzel-Schranke für Quadratische-Rest-Codes. J Geom 31, 96–99 (1988). https://doi.org/10.1007/BF01222389

Download citation

  • Received:

  • Issue Date:

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

Navigation