On nested completely regular codes and distance regular graphs
Borges, J. (Joaquim) (Joaquim)
(Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Rifà i Coma, Josep (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Zinoviev, Victor (Kharkevich Institute for Problems of Information Transmission)
Date: |
2014 |
Abstract: |
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i. e. , as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive. |
Grants: |
Ministerio de Ciencia e Innovación TIN2013-40524-P Agència de Gestió d'Ajuts Universitaris i de Recerca 2014/SGR-691
|
Note: |
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory (September 7-13, 2014, Svetlogorsk, Russia) |
Rights: |
Tots els drets reservats. |
Language: |
Anglès |
Document: |
Capítol de llibre |
Published in: |
International Workshop on Algebraic and Combinatorial Coding Theory. Svetlogorsk,Russia, 14th : 2014 : p. 85-90 |
The record appears in these collections:
Research literature >
UAB research groups literature >
Research Centres and Groups (research output) >
Engineering >
Combinatorics, Coding and Security Group (CCSG)Contributions to meetings and congresses >
Papers and communications >
UAB papers and communications
Record created 2015-11-06, last modified 2022-10-06