Partial permutation decoding for binary linear Hadamard codes

R. D. Barrolleta, M. Villanueva

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)

Abstract

© 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.
Original languageEnglish
Pages (from-to)35-42
JournalElectronic Notes in Discrete Mathematics
Volume46
Issue number1
DOIs
Publication statusPublished - 1 Jan 2014

Keywords

  • Automorphism groups
  • Hadamard codes
  • Permutation decoding

Fingerprint Dive into the research topics of 'Partial permutation decoding for binary linear Hadamard codes'. Together they form a unique fingerprint.

Cite this