PD-sets for Z4-linear codes: Hadamard and Kerdock codes

Roland D. Barrolleta, Merce Villanueva

Research output: Chapter in BookChapterResearchpeer-review

2 Citations (Scopus)

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 Z4-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (nonlinear) Z4-linear codes such as Hadamard and Kerdock codes are given.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1317-1321
Number of pages5
ISBN (Electronic)9781509018062
DOIs
Publication statusPublished - 10 Aug 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Fingerprint

Dive into the research topics of 'PD-sets for Z<sub>4</sub>-linear codes: Hadamard and Kerdock codes'. Together they form a unique fingerprint.

Cite this