New nonbinary code bounds based on divisibility arguments

Abstract: For

q, n, d i n m a t h b b N

, let

A_{q} (n, d)

be the maximum size of a code

C s u b s e t e q [q]^{n}

with minimum distance at least

d

. We give a divisibility argument resulting in the new upper bounds

A_{5} (8, 6) l e q 65

,

A_{4} (11, 8) l e q 60

and

A_{3} (16, 11) l e q 29

. These in turn imply the new upper bounds

A_{5} (9, 6) l e q 325

,

A_{5} (10, 6) l e q 1625

,

A_{5} (11, 6) l e q 8125

and

A_{4} (12, 8) l e q 240

. Furthermore, we prove that for

m u, q i n m a t h b b N

, there is a 1-1-correspondence between symmetric

(m u, q)

-nets (which are certain designs) and codes

C s u b s e t e q [q]^{m u q}

of size

m u q^{2}

with minimum distance at least

m u q - m u

. We derive the new upper bounds

A_{4} (9, 6) l e q 120

and

A_{4} (10, 6) l e q 480

from these `symmetric net' codes.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: New nonbinary code bounds based on divisibility arguments