AbstractWe show by example that the covering radius of a binary linear code is not generally determined by the Tutte polynomial of the matroid. This answers Problem 361 (P.J. Cameron (Ed.), Research problems, Discrete Math. 231 (2001) 469–478)
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
A linear code can be thought of as a vector matroid represented by the columns of code's genera...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
We show by example that the covering radius of a binary linear code is not generally determined by t...
AbstractWe show by example that the covering radius of a binary linear code is not generally determi...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
The covering radius of a code is the least r such that the set of balls of radius r around codewords...
AbstractA. Tietäväinen discovered, how polynomials with suitable Fourier–Krawtchouk coefficients can...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractLet C0 be a subcode of codimension i of a binary code C. We show that the covering radius ϱ(...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
A linear code can be thought of as a vector matroid represented by the columns of code's genera...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
We show by example that the covering radius of a binary linear code is not generally determined by t...
AbstractWe show by example that the covering radius of a binary linear code is not generally determi...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
The covering radius of a code is the least r such that the set of balls of radius r around codewords...
AbstractA. Tietäväinen discovered, how polynomials with suitable Fourier–Krawtchouk coefficients can...
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractLet C0 be a subcode of codimension i of a binary code C. We show that the covering radius ϱ(...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
A linear code can be thought of as a vector matroid represented by the columns of code's genera...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
DOI
Add to ORKG