Cyclic Codes from APN and Planar Functions
From MaRDI portal
Publication:6233828
DOI10.1137/120882275zbMATH Open1306.94114arXiv1206.4687MaRDI QIDQ6233828FDOQ6233828
Authors: Cunsheng Ding 
Publication date: 19 June 2012
Abstract: Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear functions and planar functions over finite fields are employed to construct a number of classes of cyclic codes. Lower bounds on the minimum weight of some classes of the cyclic codes are developed. The minimum weights of some other classes of the codes constructed in this paper are determined. The dimensions of the codes are flexible. Many of the codes presented in this paper are optimal or almost optimal in the sense that they meet some bound on linear codes. Ten open problems regarding cyclic codes from highly nonlinear functions are also presented.
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
This page was built for publication: Cyclic Codes from APN and Planar Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233828)
