AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-transitive graphs Ok. Perfect 1-codes correspond to certain Steiner systems and necessary conditions for the existence of such a code are satisfied if k + 1 is prime. We give some nonexistence results for perfect 2-, 3-, and 4-codes and for perfect e-codes in general, including a lower bound for k in terms of e
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
We construct several classes of completely regular codes with different parameters, but identical in...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractThe generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the c...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractIn this paper we consider the relationship between q-coverings of a regular graph and perfec...
AbstractPerfect codes and optimal anticodes in the Grassman graph Gq(n, k) are examined. It is shown...
AbstractA code in a graph Γ is a non-empty subset C of the vertex set V of Γ. Given C, the partition...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
We construct several classes of completely regular codes with different parameters, but identical in...
AbstractIn this paper we consider the existence of perfect codes in the infinite class of distance-t...
AbstractThe idea of a nearly perfect code in a vector space over a binary field is generalized to th...
AbstractThe classical problem of the existence of perfect codes is set in a vector space. In this pa...
AbstractThe generalisation of Lloyd's theorem to distance-transitive graphs can be improved in the c...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
AbstractWe present a generalization of the notion of perfect codes: perfect codes over graphs. We sh...
AbstractIn this paper we consider the relationship between q-coverings of a regular graph and perfec...
AbstractPerfect codes and optimal anticodes in the Grassman graph Gq(n, k) are examined. It is shown...
AbstractA code in a graph Γ is a non-empty subset C of the vertex set V of Γ. Given C, the partition...
AbstractAssuming the existence of a partition in perfect codes of the vertex set of a finite or infi...
AbstractWe prove that the following problems are NP-complete: (1) the existence of a 1-perfect code ...
AbstractWe give another proof of Lloyd's theorem using homogeneous distance enumerators, and show th...
AbstractThe main result of the paper is the proof of the non-existence of a class of completely regu...
We construct several classes of completely regular codes with different parameters, but identical in...