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.
Original language | English |
---|---|
Pages (from-to) | 2392-2393 |
Number of pages | 2 |
Journal | Discrete Mathematics |
Volume | 312 |
Issue number | 15 |
DOIs | |
State | Published - 6 Aug 2012 |
Keywords
- 68P30
- Covering radius
- Newton radius