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)
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
We show that computing the Tutte polynomial of a linear matroid of dimension k on kO(1) points over ...
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...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
AbstractIn this paper, we consider the coboundary polynomial for a matroid as a generalization of th...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
Codes, arrangements, matroids, and their polynomial links Many mathematical objects are closely rela...
We simplify the proofs of four results in [3], restating two of them for greater clarity. The main p...
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...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
AbstractT. Brylawski and J. Oxley asked, if the size of a largest circuit in a graph is a Tutte inva...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
We show that computing the Tutte polynomial of a linear matroid of dimension k on kO(1) points over ...
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...
We simplify the proofs of four results in [3], restating two of them for greater clarity
AbstractLet C be a binary linear code with covering radius R and let C0 be a subcode of C with codim...
AbstractIn this paper, we consider the coboundary polynomial for a matroid as a generalization of th...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
Codes, arrangements, matroids, and their polynomial links Many mathematical objects are closely rela...
We simplify the proofs of four results in [3], restating two of them for greater clarity. The main p...
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...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
AbstractT. Brylawski and J. Oxley asked, if the size of a largest circuit in a graph is a Tutte inva...
AbstractThe cycle code of a graph is the binary linear span of the characteristic vectors of circuit...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
We show that computing the Tutte polynomial of a linear matroid of dimension k on kO(1) points over ...
DOI
Add to ORKG