On a class of binary linear completely transitive codes with arbitrary covering radius |
| |
| Authors: | J Rifà VA Zinoviev |
| |
| Institution: | a Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain
b Institute for Problems of Information Transmission of the Russian Academy of Sciences, Bol’shoi Karetnyi per. 19, GSP-4, Moscow, 101447, Russia |
| |
| Abstract: | An infinite class of new binary linear completely transitive (and so, completely regular) codes is given. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes in the constructed class with d=3, covering radius ρ and lengths  and  , respectively. The corresponding distance-transitive graphs, which can be defined as coset graphs of these completely transitive codes are described. |
| |
| Keywords: | Completely regular code Completely transitive code Covering radius Distance-regular graph Distance-transitive graph Intersection numbers Outer distance Uniformly packed code |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
