Name
Abstract | ||
|---|---|---|
The Newton radius of a code is the largest weight of a uniquely correctable error. We establish a lower bound for the Newton radius in terms of the rate. In particular we show that in any family of linear codes of rate below one half, the Newton radius increases linearly with the codeword length. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.03.038 | Discrete Mathematics |
Keywords | Field | DocType |
68P30,Newton radius,Covering radius | Earth radius,Discrete mathematics,Radius of curvature,Upper and lower bounds,Code word,Code (cryptography),One half,Mathematics | Journal |
Volume | Issue | ISSN |
312 | 15 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alex Samorodnitsky | 1 | 723 | 56.95 |
| Sergey Yekhanin | 2 | 983 | 52.33 |