Skip to main content

The les association scheme

  • Coding And Combinatorics
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 311))

Included in the following conference series:

Abstract

In this paper we undertake a study of the Lee scheme. We give in this context a new proof of Bassalygo's generalization of Lloyd Theorem, and an asymptotic estimate of the number of zeroes of the Lloyd polynomial.

We obtain a recursion on the Lee composition distribution of the translates of a code and deduce from that an upper bound on the covering radius of a code.

We give an algebraic characterization of T-designs in this scheme, which shows that they form a special class of orthogonal arrays.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. G. ANDREWS "The theory of partitions" Addison Wesley Encyclopedia of Math and its applications.

    Google Scholar 

  2. J. ASTOLA "The theory of Lee codes" Research report 1982 University of Lappeenranta, Finland.

    Google Scholar 

  3. E. BANNAI and T. ITO "Algebraic combinatorics". Benjamin Cummings.

    Google Scholar 

  4. L.A. BASSALYGO "A necessary condition for the existence of perfect codes in the Lee-metric" Mat. Zametki 15, p. 313–320, 1974.

    Google Scholar 

  5. E.R. BERLEKAMP "Algebraic coding theory" Revised 1984 edition Aegean Park Press.

    Google Scholar 

  6. N. BIGGS "Finite groups of automorphisms". Cambridge University Press.

    Google Scholar 

  7. R.C. BOSE and D.M. MESNER (1959) "On linear associative algebras corresponding to association schemes of partially balanced designs" Ann. Math. Statist. 10 p. 21–38.

    Google Scholar 

  8. P. DELSARTE "Four fundamental parameters of a code and their combinarorial significance" Info and Control 1973, 23, p. 407–438.

    Google Scholar 

  9. P. DELSARTE "An algebraic approach to the association schemes of coding theory" Philips Res. Rpts. Suppl 1973 No 10.

    Google Scholar 

  10. S.W. GOLOMB and L.R. WELCH "Perfect codes in the Lee metric and the packing of polyominoes" SIAM J. Appl. Math. Vol 18 No 2 pp. 302–317, 1970.

    Google Scholar 

  11. S.W. GOLOMB and L.R. WELCH "Algebraic coding and the Lee metric" in Error correcting codes. H.B. MANN ed. p. 175–194 Wiley N.Y. 1968.

    Google Scholar 

  12. C.Y. LEE "Some properties of non binary error correcting codes" IEEE transactions on Information Theory. IT-4 p. 77–82.

    Google Scholar 

  13. F.J. MAC WILLIAMS (1961) Doctoral Disertation Harvard University unpublished.

    Google Scholar 

  14. F.J. MAC WILLIAMS and N.J.A. SLOANE "The theory of error correcting codes" North Holland.

    Google Scholar 

  15. P. SOLE "On the parameters of Lee Codes" in preparation.

    Google Scholar 

  16. H. TARNANEN "An approach to constant weight and Lee codes by using the methods of association schemes" Thesis Turku University 1982. Finland.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Cohen P. Godlewski

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sole, P. (1988). The les association scheme. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-19368-5_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19368-5

  • Online ISBN: 978-3-540-39243-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics