Partial permutation decoding for binary linear Hadamard codes

Abstract: Permutation decoding is a technique which involves finding a subset

S

, called PD-set, of the permutation automorphism group of a code

C

in order to assist in decoding. An explicit construction of

l e f t l f l o o r f r a c 2^{m} - m - 1 1 + m i g h t f l o o r

-PD-sets of minimum size

l e f t l f l o o r f r a c 2^{m} - m - 1 1 + m i g h t f l o o r + 1

for partial permutation decoding for binary linear Hadamard codes

H_{m}

of length

2^{m}

, for all

m g e q 4

, is described. Moreover, a recursive construction to obtain

s

-PD-sets of size

l

for

H_{m + 1}

of length

2^{m + 1}

, from a given

s

-PD-set of the same size for

H_{m}

, is also established. These results are generalized to find

s

-PD-sets for (nonlinear) binary Hadamard codes of length

2^{m}

, called

m a t h b b Z_{4}

-linear Hadamard codes, which are obtained as the Gray map image of quaternary linear codes of length

2^{m - 1}

.

Recommendations

Cites work

Cited in

(11)

This page was built for publication: Partial permutation decoding for binary linear Hadamard codes