论文信息 - Binary codes from graphs on triples

Binary codes from graphs on triples

For a set @W of size n>=7 and @W^{^3^} the set of subsets of @W of size 3, we examine the ternary codes obtained from the adjacency matrix of each of the three graphs with vertex set @W^{^3^}, with adjacency defined by two vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively.

Jamshid Moori | Bernardo Gabriel Rodrigues | Jennifer D. Key

[1] Jamshid Moori,et al. Binary codes from graphs on triples and permutation decoding , 2006, Ars Comb..

[2] Shirley Dex,et al. JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[3] Jennifer D. Key,et al. Designs and their codes , 1992, Cambridge tracts in mathematics.

[4] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[5] Willem H. Haemers,et al. Binary Codes of Strongly Regular Graphs , 1999, Des. Codes Cryptogr..

[6] Vladimir D. Tonchev. Combinatorial configurations, designs, codes, graphs , 1988 .

[7] Rita Procesi,et al. Codes and groups , 2006 .

[8] Thierry Gensane. Dense Packings of Equal Spheres in a Cube , 2004, Electron. J. Comb..

[9] Jamshid Moori,et al. Permutation decoding for the binary codes from triangular graphs , 2004, Eur. J. Comb..

[10] Jennifer D. Key,et al. Designs and Codes: An update , 1996, Des. Codes Cryptogr..

[11] A. Brouwer,et al. On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs , 1992 .

[12] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[13] 吉岡智晃. Strongly Regular Graphs and Partial Geometries , 1993 .

[14] Paul R. Hafner. On the Graphs of Hoffman-Singleton and Higman-Sims , 2004, Electron. J. Comb..