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
AbstractImproved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
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...
AbstractIt is proved that the covering radius of long binary BCH codes with designed distance 2t + 1...
AbstractWe show by example that the covering radius of a binary linear code is not generally determi...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
We show by example that the covering radius of a binary linear code is not generally determined by t...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
AbstractImproved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
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...
AbstractIt is proved that the covering radius of long binary BCH codes with designed distance 2t + 1...
AbstractWe show by example that the covering radius of a binary linear code is not generally determi...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
We show by example that the covering radius of a binary linear code is not generally determined by t...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractFan Chung has recently derived an upper bound on the diameter of a regular graph as a functi...
AbstractImproved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of...
AbstractIn this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
DOI
Add to ORKG