On a class of binary linear completely transitive codes with arbitrary covering radius (Q1044974): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2009.03.004 / rank | |||
Property / cites work | |||
Property / cites work: Q4079494 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4189182 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the nonexistence of completely transitive codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On non-antipodal binary completely regular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonexistence of completely transitive codes with error-correcting capability e<3 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5707657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completely regular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4038772 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On new completely regular \(q\)-ary codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completely regular codes and completely transitive codes / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2009.03.004 / rank | |||
Normal rank |
Latest revision as of 14:38, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a class of binary linear completely transitive codes with arbitrary covering radius |
scientific article |
Statements
On a class of binary linear completely transitive codes with arbitrary covering radius (English)
0 references
15 December 2009
0 references
completely regular code
0 references
completely transitive code
0 references
covering radius
0 references
distance-regular graph
0 references
distance-transitive graph
0 references
intersection numbers
0 references
outer distance
0 references
uniformly packed code
0 references
0 references