Permutation decoding for the binary codes from triangular graphs. (Q1422399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 17:37, 31 January 2024

scientific article
Language Label Description Also known as
English
Permutation decoding for the binary codes from triangular graphs.
scientific article

    Statements

    Permutation decoding for the binary codes from triangular graphs. (English)
    0 references
    0 references
    0 references
    14 February 2004
    0 references
    Permutation decoding is an algorithm for decoding linear codes introduced by \textit{F. J. MacWilliams} [Bell Syst. Tech. J. 43, 485--505 (1964; Zbl 0116.35304)] that uses certain sets (called PD-sets) of permutations in the automorphism group of the code. The paper investigates PD-sets for the binary linear codes spanned by the rows of the adjacency matrix of a triangular graph \(T(n)\), having as vertices the 2-element subsets of a given set of size \(n\). Explicit PD-sets are found for every \(n\geq 5\).
    0 references
    permutation decoding
    0 references
    triangular graph
    0 references

    Identifiers