114 search results - page 3 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
CORR
2010
Springer
15 years 12 days ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
88
Voted
JCT
2006
15 years 8 days ago
2006
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
106
click to vote
SIAMDM
2008
15 years 7 days ago
2008
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
100
click to vote
IJAR
2010
14 years 10 months ago
2010
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
COMBINATORICS
2007
15 years 9 days ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...