Advertisement

Small weight bases for hamming codes

  • John Tromp
  • Louxin Zhang
  • Ying Zhao
Session 4B: Combinatorics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

We present constructions of bases for a Hamming code having small width and height, i.e. number of 1s in each row and column in the corresponding matrix. Apart from being combinatorially interesting in their own right, these bases also lead to improved embeddings of a hypercube of cliques into a same-sized hypercube

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. Aiello and T. Leighton, Coding theory, hypercube embeddings, and fault tolerance, Proc. of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 125–136, 1991. To appear in IEEE Trans. Computer.Google Scholar
  2. 2.
    E. Assmus, Jr and H. Mattson, On tactical configurations and error-correcting-codes, J. of Combin. Theory, vol. 2, pp. 243–257, 1967.Google Scholar
  3. 3.
    L. Babai, H. Oral and K. Phelps, Eulerian self-dual codes, SIAM J. Discrete Math., vol. 7, pp. 325–330, 1994.CrossRefGoogle Scholar
  4. 4.
    R. H. Hamming, Error detecting and error correcting codes, Bell System Technical Journal, vol. 29, pp. 147–160, 1950.Google Scholar
  5. 5.
    T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, California, 1992, Chapter 3, p. 430.Google Scholar
  6. 6.
    R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, California, 1983.Google Scholar
  7. 7.
    V. Pless, Introduction to the Theory of Error-Correcting-Codes, John Wiley and Sons, Inc., New York, 1989.Google Scholar
  8. 8.
    D. Pritikin, Graph embeddings from Hamming bases, DIMACS Workshops on Interconnection Networks and Mapping and Scheduling Parallel Computations, February 1994.Google Scholar
  9. 9.
    A. Reddy, Parallel input/output architectures for multiprocessors, Ph. D. dissertation. Dept. of Electronical and Computer Engineering, Univ. of Illinois, Urbana, 1990.Google Scholar
  10. 10.
    W. Stahnke, Primitive binary polynomials, Mathematics of Computation, vol. 124, pp. 977–980, 1973.Google Scholar
  11. 11.
    L. Zhang, A new bound for the width of Hamming codes, to appear in Proceedings of the 6th Inter. Conference on Computing and Information, 1994.Google Scholar
  12. 12.
    I. F. Blake, S.Gao and R. J. Lambert, Construction and distribution problem for irreducible trinomials over finite fields, To appear in Proceedings of the Holloway Conference on Finite Fields, Oxford University Press, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • John Tromp
    • 1
  • Louxin Zhang
    • 2
  • Ying Zhao
    • 3
  1. 1.Dept. of Comp. Sci.University of WaterlooWaterlooCanada
  2. 2.Dept. of Comp. Sci.University of WaterlooWaterlooCanada
  3. 3.Dept. of Math.Shanxi Teacher's UniversityChina

Personalised recommendations