1-perfect codes in Sierpiński graphs (Q4806494): 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the non-existence of perfect and nearly perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes on the Towers of Hanoi graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes in Bipartite Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular codes in regular graphs are difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes over graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in the graphs <i>O<sub>k</sub></i> and <i>L(O<sub>k</sub>)</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:23, 5 June 2024

scientific article; zbMATH DE number 1910647
Language Label Description Also known as
English
1-perfect codes in Sierpiński graphs
scientific article; zbMATH DE number 1910647

    Statements