Partial permutation decoding for binary linear Hadamard codes
Barrolleta, Roland David
Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)

Date:	2014
Abstract:	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 H m of length 2 m , for all m ≥ 4 and 1 < s ≤ (2 m − m − 1)/(1 + m) , is described. Moreover, a recursive construction to obtain s-PD-sets of size s + 1 for H m+1 of length 2 m+1 , from a given s-PD-set of the same size for the Hadamard code of half length H m is also established.
Grants:	Ministerio de Ciencia e Innovación TTIN2010-17358 Ministerio de Ciencia e Innovación TIN2013-40524-P Agència de Gestió d'Ajuts Universitaris i de Recerca 2014/SGR-691
Rights:	Tots els drets reservats.
Language:	Anglès
Document:	Article ; recerca ; Versió acceptada per publicar
Subject:	Permutation decoding ; Hadamard codes ; Automorphism groups
Published in:	Electronic notes in discrete mathematics, Vol. 46 (Sep. 2014) , p. 35-42, ISSN 1571-0653

DOI: 10.1016/j.endm.2014.08.006

Post-print 9 p, 1.1 MB

The record appears in these collections:
Research literature > UAB research groups literature > Research Centres and Groups (research output) > Engineering > Combinatorics, Coding and Security Group (CCSG)
Articles > Research articles
Articles > Published articles