Small weight bases for Hamming codes

Theoretical Computer Science

Volumn 181, Issue 2, 1997, Pages 337-345

  Tromp, John ^a,c   Zhang, Louxin ^a   Zhao, Ying ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b SHANXI NORMAL UNIVERSITY   (China)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MATRIX ALGEBRA;

HAMMING CODES;

CODES (SYMBOLS);

EID: 0031176250     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00278-2     Document Type: Article

References (13)

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