AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codimension i. We prove that the covering radius R0 of C satisfies R0 ⩽ 2R + 2i − 1, by setting up a graph coloring problem involving Kneser graphs
The strength and the covering radius of a binary self-complementary code are studied under different...
AbstractAn asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn s...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
AbstractLet C0 be a subcode of codimension i of a binary code C. We show that the covering radius ϱ(...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
AbstractThe use of odd graphs has been proposed as fault-tolerant interconnection networks. The foll...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
AbstractWe study binary codes of length n with covering radius one via their characteristic function...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that...
The strength and the covering radius of a binary self-complementary code are studied under different...
AbstractAn asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn s...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
AbstractLet C0 be a subcode of codimension i of a binary code C. We show that the covering radius ϱ(...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
AbstractThe use of odd graphs has been proposed as fault-tolerant interconnection networks. The foll...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
AbstractWe study binary codes of length n with covering radius one via their characteristic function...
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering ...
Letg(k, d) = sum_{i=0}^{k-1} lceil d / 2^{i} rceil. By the Griesmer bound,n geq g(k, d)for any binar...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that...
The strength and the covering radius of a binary self-complementary code are studied under different...
AbstractAn asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn s...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
DOI
Add to ORKG