Codes based on complete graphs (Q677169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of graph theoretic codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An updated table of minimum-distance bounds for binary linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of difference sets to a problem concerning graphical codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 27 May 2024

scientific article
Language Label Description Also known as
English
Codes based on complete graphs
scientific article

    Statements

    Codes based on complete graphs (English)
    0 references
    0 references
    0 references
    28 May 1997
    0 references
    embedding
    0 references
    even graphical code
    0 references
    complete graph
    0 references
    Hamming code
    0 references

    Identifiers