Codes associated with triangular graphs and permutation decoding (Q622793)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Codes associated with triangular graphs and permutation decoding |
scientific article |
Statements
Codes associated with triangular graphs and permutation decoding (English)
0 references
4 February 2011
0 references
Summary: 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 \geq 6\).
0 references
linear codes
0 references
triangular graphs
0 references
permutation decoding
0 references
automorphism groups
0 references
automorphisms
0 references