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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jennifer D. Key / rank
Normal rank
 
Property / author
 
Property / author: Jamshid Moori / rank
Normal rank
 
Property / author
 
Property / author: Bernardo Gabriel Rodrigues / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / rank
Normal rank
 
Property / author
 
Property / author: Jennifer D. Key / rank
 
Normal rank
Property / author
 
Property / author: Jamshid Moori / rank
 
Normal rank
Property / author
 
Property / author: Bernardo Gabriel Rodrigues / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vladimir D. Tonchev / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2003.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982315026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designs and codes: An update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-rank of the adjacency matrices of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal permutation sets for decoding the binary Golay codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary codes of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Decoding of Systematic Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040243 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:01, 6 June 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
    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
    0 references
    0 references

    Identifiers