Nearly perfect codes in distance-regular graphs (Q1231470): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Perfect codes in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new 5‐arc‐transitive cubic graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5707657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antipodal covering graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nearly perfect binary codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect codes in the graphs \(O_k\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of optimum nonlinear double-error-correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PRIMITIVE AND IMPRIMITIVE GRAPHS / rank | |||
Normal rank |
Latest revision as of 19:58, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nearly perfect codes in distance-regular graphs |
scientific article |
Statements
Nearly perfect codes in distance-regular graphs (English)
0 references
1976
0 references