An error e is (uniquely) correctable by an [n , k] code $\mathcal{C}$ if and only if it is the unique coset leader in its coset. The Newton radius    $(\mathcal{C})$ of $\mathcal{C}$ is the largest weight of a uniquely correctable error (it was introduced in T. Helleseth and T. Klove, ``The Newton radius of codes'', IEEE Trans. Inf. Theory, vol. 43, Nov. 1997).

We will discuss some problems on the Newton radius:

• Methods to determine $(\mathcal{C})$.
• The value of (or bounds on) $(\mathcal{C})$ for some codes.
• How are the Newton radius and the covering radius related?

Back to Workshop Schedule