Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian uniform subset graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation decoding for the binary codes from triangular graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary codes from graphs on triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: PD-sets for the codes related to some classical varieties / 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

Revision as of 19:08, 10 July 2024

scientific article
Language Label Description Also known as
English
Binary codes and partial permutation decoding sets from the Johnson graphs
scientific article

    Statements

    Binary codes and partial permutation decoding sets from the Johnson graphs (English)
    0 references
    24 September 2015
    0 references
    Johnson graphs
    0 references
    binary codes
    0 references
    automorphism group
    0 references
    permutation decoding
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references