TY - JOUR

T1 - Partial permutation decoding for binary linear Hadamard codes

AU - Barrolleta, R. D.

AU - Villanueva, M.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - © 2014 Elsevier B.V. Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s+1 for partial permutation decoding for the binary linear Hadamard codes Hm of length 2m, for all m≥4 and 1<s≤〉,2m-m-11+m, is described. Moreover, a recursive construction to obtain s-PD-sets of size s+1 for Hm+1 of length 2m+1, from a given s-PD-set of the same size for the Hadamard code of half length Hm is also established.

AB - © 2014 Elsevier B.V. Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s+1 for partial permutation decoding for the binary linear Hadamard codes Hm of length 2m, for all m≥4 and 1<s≤〉,2m-m-11+m, is described. Moreover, a recursive construction to obtain s-PD-sets of size s+1 for Hm+1 of length 2m+1, from a given s-PD-set of the same size for the Hadamard code of half length Hm is also established.

KW - Automorphism groups

KW - Hadamard codes

KW - Permutation decoding

UR - https://ddd.uab.cat/record/142848

U2 - https://doi.org/10.1016/j.endm.2014.08.006

DO - https://doi.org/10.1016/j.endm.2014.08.006

M3 - Article

VL - 46

SP - 35

EP - 42

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

IS - 1

ER -