I. Introduction. Let V I be an [n 1,k I] code, V 2 be an [n2,n2-1] parity check code, W [nln2,n2(nl-kl)+k I] be the dual of the iterative code VI| 2.

The normality of binary codes is studied. The minimum cardinality of a binary code of length n with covering radius R is denoted by K ( n , R ).

Jun 22, 2005 · We present some new lower and upper bounds for the covering radius of codes dual to the product of parity check codes.

Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of ...

There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other ...

Jul 25, 2018 · In what follows, we highlight the gap by comparing the covering radius of dual BCH codes with the typical covering radius of linear codes of the.

Tietaivainen (1991) derived an upper bound on the covering radius of codes as a function of the dual distance. This was generalized to the minimum distance, ...

Specifically, we establish a simple relation between the minimal distance (equivalently, packing radius) of a code and the essential covering radius of its dual ...

We give upper bounds on the covering radius of a code by applying different combinatorial methods. The various bounds are then applied to the classes of ...

In this chapter we discuss upper bounds on covering radius in binary space. There is an essential difference between the two notions.