Codes associated with triangular graphs and permutation decoding

Linear codes that can be obtained from designs associated with the complete graph on n vertices and its line graph, the triangular graph, are examined. The codes have length n choose 2, dimension n or n − 1, and minimum weight n − 1 or 2n − 4. The parameters of the codes and their automorphism groups for any odd prime are obtained and PD-sets inside the symmetric group S n are found for full permutation decoding for all primes and all integers n ≥ 6.

[1]  Jennifer D. Key,et al.  Partial permutation decoding for codes from finite planes , 2005, Eur. J. Comb..

[2]  A. Brouwer,et al.  On the pRank of the Adjacency Matrices of Strongly Regular Graphs , 2003 .

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

[4]  Washiela Fish,et al.  Binary codes from the line graph of the n-cube , 2010, J. Symb. Comput..

[5]  Andries E. Brouwer,et al.  Strongly regular graphs and partial geometries , 1984 .

[6]  Mohammed S. EL-Atrash,et al.  Linear Codes over Finite Fields , 2018, Designs from Linear Codes.

[7]  Washiela Fish,et al.  Codes from incidence matrices and line graphs of Hamming graphs , 2010, Discret. Math..

[8]  Daniel M. Gordon.  Minimal permutation sets for decoding the binary Golay codes , 1982, IEEE Trans. Inf. Theory.

[9]  Hans-Joachim Kroll,et al.  PD-sets for the codes related to some classical varieties , 2005, Discret. Math..

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

[11]  J. Macwilliams.  Permutation decoding of systematic codes , 1964 .

[12]  René Peeters.  On the p-Ranks of the Adjacency Matrices of Distance-Regular Graphs , 2002 .

[13]  W. Fish.  Codes from uniform subset graphs and cycle products , 2007 .

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

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

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

[17]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[18]  R. Brualdi,et al.  Handbook Of Coding Theory , 2011 .

[19]  W. Bosma,et al.  HANDBOOK OF MAGMA FUNCTIONS , 2011 .

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

[21]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

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

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