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

关于APN函数循环码的一个注记

A Note on Cyclic Codes from APN Functions

Chunming Tang, Yanfeng Qi, Maozhi Xu

摘要:

循环码作为编码理论中的线性分组纠错码,具有重要的地位和广泛的应用。Ding在\cite{D}中利用有限域上的几乎完全非线性(APN)函数和平面函数构造了一类循环码,并提出了关于高度非线性函数循环码的十个公开问题.在本文中,我们考虑两个公开的问题,涉及反APN函数$f(x)=x^{q^m-2}$和Dobbertin APN函数$f(x)=x^{2^{4i}+2^{3i}+2^{2i}+2^{i}-1}$。通过计算这两类APN函数生成的两个序列的线性跨度和最小多项式,确定了相应循环码的维数,并给出了这些循环码最小重量的下界。实际上,我们提出了一个由$s_t=Tr((1+α^t)^e)$定义的序列$s^{\infty}$的最小多项式和线性跨度的框架,其中$α$是$GF(q)$中的本原元素。这些技术也可应用于\cite{D}中的其他开放问题。

英文摘要:

Cyclic codes, as linear block error-correcting codes in coding theory, play a vital role and have wide applications. Ding in \cite{D} constructed a number of classes of cyclic codes from almost perfect nonlinear (APN) functions and planar functions over finite fields and presented ten open problems on cyclic codes from highly nonlinear functions. In this paper, we consider two open problems involving the inverse APN functions $f(x)=x^{q^m-2}$ and the Dobbertin APN function $f(x)=x^{2^{4i}+2^{3i}+2^{2i}+2^{i}-1}$. From the calculation of linear spans and the minimal polynomials of two sequences generated by these two classes of APN functions, the dimensions of the corresponding cyclic codes are determined and lower bounds on the minimum weight of these cyclic codes are presented. Actually, we present a framework for the minimal polynomial and linear span of the sequence $s^{\infty}$ defined by $s_t=Tr((1+α^t)^e)$, where $α$ is a primitive element in $GF(q)$. These techniques can also be applied into other open problems in \cite{D}.

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

↑