Comparing decoding methods for quaternary linear codes

详细信息    查看全文

• 作者：R.D. Barrolleta ^{rolanddavid.barrolleta@uab.cat" class="auth_mail" title="E-mail the corresponding author} ; J. Pujol ^{jaume.pujol@uab.cat" class="auth_mail" title="E-mail the corresponding author} ; M. Villanueva ^{merce.villanueva@uab.cat" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Z4Z4-linear codes ; PD-sets ; decoding ; Hadamard codes ; Kerdock codes
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：54
• 期：Complete
• 页码：283-288
• 全文大小：201 K

文摘

Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C  . Constructions of small PD-sets for partial decoding for two families of Z₄${\mathbb{Z}}_4$-linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for Z₄-linear codes are compared by showing their performance applied to these two families.