AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and covering radius 1 satisfies |C| ≥ qn−1/(n − 1). For the special case n = q = 4 the smallest known example has |C| = 31. We give a construction for such a code C with |C| = 28
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-know...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
AbstractLet Ω be a set of q symbols and Ωn={x1…xn|xi∈Ω}. We prove that for any fixed q and R, there ...
AbstractWe study a construction method introduced by Kamps and van Lint and generalized by Blokhuis ...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
We consider generalized surjective codes, together with their connection to covering codes and cover...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Recent...
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
Let K-q(n, R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let ...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-know...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
AbstractLet Ω be a set of q symbols and Ωn={x1…xn|xi∈Ω}. We prove that for any fixed q and R, there ...
AbstractWe study a construction method introduced by Kamps and van Lint and generalized by Blokhuis ...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
We consider generalized surjective codes, together with their connection to covering codes and cover...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Recent...
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
Let K-q(n, R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let ...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-know...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
DOI
Add to ORKG