AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary code of length 9 and covering radius 1. We show that a binary code of length 9, 55 codewords and covering radius 1 does not exist which gives a new lower bound K2(9, 1) ⩾ 56
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
Let K-q(n, R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let ...
AbstractLet Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractWe study binary codes of length n with covering radius one via their characteristic function...
AbstractWe introduce a refinement in the method proposed some time ago by Haas for obtaining new low...
The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of l...
AbstractImproved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of...
AbstractWe develop two methods for obtaining new lower bounds for the cardinality of covering codes....
International audienceWe introduce a refinement in the method proposed some time ago by Haas for obt...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radiu...
Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Recent...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
Let K-q(n, R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let ...
AbstractLet Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractWe study binary codes of length n with covering radius one via their characteristic function...
AbstractWe introduce a refinement in the method proposed some time ago by Haas for obtaining new low...
The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of l...
AbstractImproved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of...
AbstractWe develop two methods for obtaining new lower bounds for the cardinality of covering codes....
International audienceWe introduce a refinement in the method proposed some time ago by Haas for obt...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radiu...
Let Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Recent...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
Let K-q(n, R) denote the minimal cardinality of a q-ary code of length n and covering radius R. Let ...
AbstractLet Kq(n,R) denote the minimal cardinality of a q-ary code of length n and covering radius R...
DOI
Add to ORKG