论文信息 - Small Weight Bases for Hamming Codes

Small Weight Bases for Hamming Codes

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

Louxin Zhang | Ying Zhao | John Tromp

[1] Kevin T. Phelps,et al. Eulerian Self-Dual Codes , 1994, SIAM J. Discret. Math..

[2] Wayne Stahnke. Primitive binary polynomials , 1973 .

[3] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .

[4] V. Pless. Introduction to the Theory of Error-Correcting Codes , 1991 .

[5] H. F. Mattson,et al. On tactical configurations and error-correcting codes* , 1967 .

[6] Rudolf Lide,et al. Finite fields , 1983 .

[7] Frank Thomson Leighton,et al. Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.

[8] I. Blake,et al. Construction and Distribution Problems for Irreducible Trinomials over Finite Fields , 1996 .

[9] Narasimha Reddy Lakshmi Annapareddy. Parallel Input/Output Architectures for Multiprocessors , 1990 .

[10] Arnold L. Rosenberg,et al. Interconnection Networks and Mapping and Scheduling Parallel Computations: Dimacs Workshop, February 7-9, 1994 , 1995 .

[11] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .