On a class of binary linear completely transitive codes with arbitrary covering radius☆
Under an Elsevier user license
open archive
Keywords
Completely regular code
Completely transitive code
Covering radius
Distance-regular graph
Distance-transitive graph
Intersection numbers
Outer distance
Uniformly packed code
Cited by (0)
- ☆
This work has been partially supported by the Spanish MEC Grants MTM2006-03250, TSI2006-14005-C02-01 and PCI2006-A7-0616 as well as by the Russian fund of fundamental research (the number of the project, 06 - 01 - 00226).
Copyright © 2009 Elsevier B.V. All rights reserved.