AbstractThe generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the case of antipodal graphs by looking at the derived graph. In the case of binary perfect codes the roots of the Lloyd polynomial are even integers. This can be applied to give a short proof of the binary perfect code theorem
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
AbstractThe generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the c...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
In this paper infinite families of linear binary nested completely regular codes are constructed. Th...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
AbstractA code in a graph Γ is a non-empty subset C of the vertex set V of Γ. Given C, the partition...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\varGamma$ of the Hamming...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
AbstractThe generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the c...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
In this paper infinite families of linear binary nested completely regular codes are constructed. Th...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
AbstractA code in a graph Γ is a non-empty subset C of the vertex set V of Γ. Given C, the partition...
AbstractWe construct vertex-transitive graphs Γ, regular of valency k=n2+n+1 on v=2(2nn) vertices, w...
Publicació amb motiu de la 14th International Workshop on Algebraic and Combinatorial Coding Theory ...
A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\varGamma$ of the Hamming...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractA binary code C is said to be completely regular if the weight distribution of any translate...
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
DOI
Add to ORKG