Skip to main content

Codes and Designs

  • Conference paper
Higher Combinatorics

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 31))

  • 270 Accesses

Abstract

We denote by V(n,q) the set of all n-tuples from a q-symbol alphabet F (i.e. V(n,q) = F n). If q is a prime power we take F = F q and interpret V(n,q) as n-dimensional vector space over F q any case we distinguish an element of F and denote it by 0. The elements of V(n,q) are called words (or vectors) and are denoted by underlined symbols. The word (0,0,…,0) is denoted by 0. The (Hamming) distance d(x,y) of two words x and y is defined by \({\rm{d}}(\underline {\rm{x}} ,\underline y ): = \left\{ {{\rm{i}}\left| 1 \right.} \right. \le {\rm{i}} \le {\rm{n,}}{{\rm{x}}_{\rm{i}}}\left. {{{\rm{y}}_{\rm{i}}}} \right\}\)

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Bannai, On perfect codes in the Hamming schemes H(n,q) with q arbitrary (submitted)

    Google Scholar 

  2. L.A. Bassalygo, V.A. Zinoviev, V.K. Leontiev and N.I. Feld-man, Nonexistence of perfect codes over some alphabets (in russian), Problemy Peredachi Informatsii 11 (1975), 3–13

    MATH  Google Scholar 

  3. D.M. Cvetkovic and J.H. van Lint, An elementary proof of Lloyd’s theorem, Proc. Kon. Ned. Akad. v. Wet. (to appear)

    Google Scholar 

  4. P. Delsarte, Two-weight linear codes and strongly regular normed spaces, Discr. Math. 3 (1972), 47–64

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Delsarte, An algebraic Approach to the Association Schemes of Coding Theory, (Philips Res. Repts. Suppl. H)10 (1973)

    Google Scholar 

  6. J.M. Goethals and H.C.A. van Tilborg, Uniformly packed codes, Philips Res. Repts. 30 (1975), 9–36

    MATH  Google Scholar 

  7. J.H. van Lint, Recent results on perfect codes and related topics, in Combinatorics I (M. Hall and J.H. van Lint eds.), Math. Centre Tracts 55 (1974)

    Google Scholar 

  8. H.F. Reuvers, Some nonexistence theorems for perfect error correcting codes, Thesis, Technological University Eindhoven (1977)

    Google Scholar 

  9. N.V. Semakov, V.A. Zinoviev and G.V. Zaitsev, Uniformly packed codes, Problemy Peredachi Informatsii (1971), 38–50

    Google Scholar 

  10. G. Szegö, Orthogonal polynomials, Amer. Math. Soc. Coll. Publ.23 (1959)

    Google Scholar 

  11. A. Tietäväinen, Nonexistence of nontrivial perfect codes in case \(q\mathop p\nolimits_i^r \mathop p\nolimits_2^s \ge 3\), Discrete Math, (to appear)

    Google Scholar 

  12. H.C.A. van Tilborg, Uniformly packed codes, Thesis, Technological University Eindhoven, (1976)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1977 D. Reidel Publishing Company, Dordrecht-Holland

About this paper

Cite this paper

van Lint, J.H. (1977). Codes and Designs. In: Aigner, M. (eds) Higher Combinatorics. NATO Advanced Study Institutes Series, vol 31. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1220-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-1220-1_16

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-1222-5

  • Online ISBN: 978-94-010-1220-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics