Semidefinite bounds for mixed binary/ternary codes

Abstract: For nonnegative integers

n_{2}, n_{3}

and

d

, let

N (n_{2}, n_{3}, d)

denote the maximum cardinality of a code of length

n_{2} + n_{3}

, with

n_{2}

binary coordinates and

n_{3}

ternary coordinates (in this order) and with minimum distance at least

d

. For a nonnegative integer

k

, let

m a t h c a l C_{k}

denote the collection of codes of cardinality at most

k

. For

D i n m a t h c a l C_{k}

, define

S (D) := C i n m a t h c a l C_{k} m i d D s u b s e t e q C, | D | + 2 | C s e t m i n u s D | l e q k

. Then

N (n_{2}, n_{3}, d)

is upper bounded by the maximum value of

s u m_{v i n [2]^{n_{2}} [3]^{n_{3}}} x (v)

, where

x

is a function

m a t h c a l C_{k} i g h t a r r o w m a t h b b R

such that

x (e m p t y s e t) = 1

and

x (C) = 0

if

C

has minimum distance less than

d

, and such that the

S (D) i m e s S (D)

matrix

(x (C c u p C^{'}))_{C, C^{'} i n S (D)}

is positive semidefinite for each

D i n m a t h c a l C_{k}

. By exploiting symmetry, the semidefinite programming problem for the case

k = 3

is reduced using representation theory. It yields

135

new upper bounds that are provided in tables

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Semidefinite bounds for mixed binary/ternary codes