PD-sets for Z₄-linear codes : Hadamard and Kerdock codes
Barrolleta, Roland David
Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)

Date:	2016
Abstract:	Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (nonlinear) Z₄-linear codes such as Hadamard and Kerdock codes are given.
Grants:	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:	Error correction ; PD-set ; Z₄-linear code ; Hadamard code ; Kerdock code ; Permutation decoding ; Permutation automorphism group
Published in:	2016 IEEE International Symposium on Information Theory (ISIT), (Aug. 2016) , p. 1317-1321, ISSN 2157-8117

DOI: 10.1109/ISIT.2016.7541512

Post-print 5 p, 2.0 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