Partial permutation decoding for binary linear Hadamard codes

R. D. Barrolleta, M. Villanueva

Producció científica: Contribució a revistaArticleRecercaAvaluat per experts

4 Cites (Scopus)

Resum

© 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.
Idioma originalAnglès
Pàgines (de-a)35-42
RevistaElectronic Notes in Discrete Mathematics
Volum46
Número1
DOIs
Estat de la publicacióPublicada - 1 de gen. 2014

Fingerprint

Navegar pels temes de recerca de 'Partial permutation decoding for binary linear Hadamard codes'. Junts formen un fingerprint únic.

Com citar-ho