Skip to main content
Log in

Hyperplane codes

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We construct a family of linear codes of lengthN=( n m )(q-1)m-1 and of dimensionn (orn−1) overGF(q). Their minimum distance and their weight distribution are calculated. These codes are subschemes of the hypercubic association schemeH(N,q).

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

References

  1. Bier, Th.: A family of nonbinary linear codes with large minimum distance (submitted)

  2. Camion, P.: Linear codes with given automorphism groups, Discrete Math.3, 33–45 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cohen, A.M.: A Synposis of Known Distance-Regular Graphs with Large Diameters (notes from lectures given by E. Bannai at Oberwolfach 1980). Amsterdam: mathematisch centrum 1981

    Google Scholar 

  4. Delsarte, Ph.: Weights of linear codes and strongly normed spaces. Discrete Math.3, 47–64 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  5. Delsarte, Ph.: An algebraic approach to the association schemes of coding theory. Philips Research Reports Suppl.10, 1–97 (1973)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bier, T. Hyperplane codes. Graphs and Combinatorics 1, 207–212 (1985). https://doi.org/10.1007/BF02582948

Download citation

  • Issue Date:

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

Keywords

Navigation