Codes associated with triangular graphs and permutation decoding (Q622793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jamshid Moori / rank
Normal rank
 
Property / author
 
Property / author: Bernardo Gabriel Rodrigues / rank
Normal rank
 
Property / author
 
Property / author: Jamshid Moori / rank
 
Normal rank
Property / author
 
Property / author: Bernardo Gabriel Rodrigues / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:47, 5 March 2024

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
    0 references
    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

    Identifiers