AbstractThe main result of the paper is the proof of the non-existence of a class of completely regular codes in certain distance-regular graphs. Corollaries of this result establish the non-existence of perfect and nearly perfect codes in the infinite families of distance-regular graphs J(2b + 1, b) and J(2b+2,b)
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
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 idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
In this paper infinite families of linear binary nested completely regular codes are constructed. Th...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
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 idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
In this dissertation we study distance-regular graphs. In particular, we look for codes inside them ...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
In this paper infinite families of linear binary nested completely regular codes are constructed. Th...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractThe study of P-polynomial association schemes, or distance-regular graphs, and their possibl...
In this article, we study completely regular codes in some distance regular graphs. Completely regul...
DOI
Add to ORKG