arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.05077cs.ITmath.IT
收藏

有限域上一类3维最优三权循环码的特征

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field

Gerardo Vega

摘要:

众所周知,确定循环码族的重量分布的问题通常是非常困难的。一个更困难的问题是找到循环码族的特征在他们的重量分布。另一方面,也是众所周知的,具有较少重量的循环码在编码理论和密码学中具有很大的实际重要性。特别地,具有三个非零权重的循环码已经被一些作者研究,然而,这些努力大多集中在素域上的循环码。在这项工作中,我们提出了一类最佳的三重量循环码的3维的任何有限域上的一个特征。在这个特征下的代码,事实上,最佳的意义上,他们的长度达到了Griesmer下界的线性码。因此,这些代码达到,同时,最好的可能的编码能力,也是最好的可能能力的错误检测和纠正的线性码。但是因为它们本质上是循环的,它们也拥有丰富的代数结构,可以以各种方式使用,特别是在设计非常有效的编码和解码算法时。同样值得指出的是,描述我们这类最优三重循环码的必要和充分数值条件的简单性。正如我们已经指出的,找到这种特征是一个困难的问题。然而,对于这种特殊情况,使我们能够找到我们的特征的基本工具是由B引入的所有二重不可约循环码的特征。Schmidt和C. White(2002).最后,关于这类码的另一个特征是,它们的编码似乎总是具有与最著名的线性码相同的参数。

英文摘要:

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present a characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field. The codes under this characterization are, indeed, optimal in the sense that their lengths reach the Griesmer lower bound for linear codes. Consequently, these codes reach, simultaneously, the best possible coding capacity, and also the best possible capabilities of error detection and correction for linear codes. But because they are cyclic in nature, they also possess a rich algebraic structure that can be utilized in a variety of ways, particularly, in the design of very efficient coding and decoding algorithms. What is also worth pointing out, is the simplicity of the necessary and sufficient numerical conditions that characterize our class of optimal three-weight cyclic codes. As we already pointed out, it is a hard problem to find this kind of characterizations. However, for this particular case the fundamental tool that allowed us to find our characterization was the characterization for all two-weight irreducible cyclic codes that was introduced by B. Schmidt and C. White (2002). Lastly, another feature about the codes in this class, is that their duals seem to have always the same parameters as the best known linear codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑