Families of optimal codes for strong identification (Q1613402): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes identifying sets of vertices in Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two families of optimal identifying codes in binary Hamming spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:22, 4 June 2024

scientific article
Language Label Description Also known as
English
Families of optimal codes for strong identification
scientific article

    Statements

    Families of optimal codes for strong identification (English)
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamming space
    0 references
    lower bounds
    0 references
    optimal strongly identifying codes
    0 references