Some bounds on binary LCD codes

Abstract: A linear code with a complementary dual (or LCD code) is defined to be a linear code

C

whose dual code

C^{p e r p}

satisfies

C c a p C^{p e r p}

=

l e f t m a t h b f 0 i g h t

. Let

L C D [n, k]

denote the maximum of possible values of

d

among

[n, k, d]

binary LCD codes. We give exact values of

L C D [n, k]

for

1 l e k l e n l e 12

. We also show that

L C D [n, n - i] = 2

for any

i g e q 2

and

n g e q 2^{i}

. Furthermore, we show that

L C D [n, k] l e q L C D [n, k - 1]

for

k

odd and

L C D [n, k] l e q L C D [n, k - 2]

for

k

even.

Recommendations

Cites work

Cited in

(42)

Describes a project that uses

Uses Software

This page was built for publication: Some bounds on binary LCD codes