Add to ORKGIn this article, we study completely regular codes in some distance regular graphs. Completely regular codes were first studied by Biggs [2] and P. Delsarte [4], but there are not yet many articles on this subject. Recently, research of completely regular codes has been developing with research o
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
We obtain several classes of completely regular codes with different parameters, but identical inter...
In this article, we study completely regular codes in some distance regular graphs. Completely regul...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
International audienceWe show that no more new distance-regular graphs in the tables of the book of ...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
We obtain several classes of completely regular codes with different parameters, but identical inter...
In this article, we study completely regular codes in some distance regular graphs. Completely regul...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
International audienceWe show that no more new distance-regular graphs in the tables of the book of ...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
International audienceThe dodecacode is a nonlinear additive quaternary code of length 12. By punctu...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
We obtain several classes of completely regular codes with different parameters, but identical inter...