On the Newton and covering radii of linear codes
E Gahidulin, T Klove - IEEE Transactions on Information Theory, 1999 - ieeexplore.ieee.org
E Gahidulin, T Klove
IEEE Transactions on Information Theory, 1999•ieeexplore.ieee.org… It was shown that for a code of dimension k, the Newton radius is at least r 0 k, where r is
the covering radius of the code. In [2], the upper bound n 0 k on r + for binary … CODES OF
DIMENSION 1 In this section we determine exactly the Newton and covering radii for codes
of dimension 1. The main reason is that this will be needed as a basis for an induction later. …
the covering radius of the code. In [2], the upper bound n 0 k on r + for binary … CODES OF
DIMENSION 1 In this section we determine exactly the Newton and covering radii for codes
of dimension 1. The main reason is that this will be needed as a basis for an induction later. …
The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given.
ieeexplore.ieee.org
Showing the best result for this search. See all results