An application of difference sets to a problem concerning graphical codes (Q1365509): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: David P. Brown / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: David P. Brown / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of graph theoretic codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical codes revisited / 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: The diophantine equation \(x^2+7=2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0378-3758(96)00166-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973852059 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:52, 30 July 2024

scientific article
Language Label Description Also known as
English
An application of difference sets to a problem concerning graphical codes
scientific article

    Statements

    An application of difference sets to a problem concerning graphical codes (English)
    0 references
    0 references
    0 references
    4 September 1997
    0 references
    The authors prove that a binary code generated by a complete graph on \(n\) nodes is contained in some Hamming code if and only if \(n=2,3\), or 6.
    0 references
    0 references
    difference set
    0 references
    binary code
    0 references
    Hamming code
    0 references
    0 references