关于选择最优非线性二元码的代数表示
On the algebraic representation of selected optimal non-linear binary codes
摘要:
重新审视Conway和Sloane的方法,我们研究了一组最优非线性二进制码,并将它们表示为Z4上的(非线性)码。傅立叶变换将被用来分析这些代码,这导致了一个新的代数表示,涉及在一定的环的单位群的子群。我们的结果之一是Best(10,40,4)码作为群环Z4[Z5]的可逆元群中子群的陪集的一个新表示。这产生了一个特别简单的代数解码算法,这个代码。本文进一步应用这种方法分析了Julin的(12,144,4)码和(12,24,12)Hadamard码。它也可以用来构造(非最优)二进制(14,56,6)码。
英文摘要:
Revisiting an approach by Conway and Sloane we investigate a collection of optimal non-linear binary codes and represent them as (non-linear) codes over Z4. The Fourier transform will be used in order to analyze these codes, which leads to a new algebraic representation involving subgroups of the group of units in a certain ring. One of our results is a new representation of Best's (10, 40, 4) code as a coset of a subgroup in the group of invertible elements of the group ring Z4[Z5]. This yields a particularly simple algebraic decoding algorithm for this code. The technique at hand is further applied to analyze Julin's (12, 144, 4) code and the (12, 24, 12) Hadamard code. It can also be used in order to construct a (non-optimal) binary (14, 56, 6) code.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。