Binary cyclic codes from explicit polynomials over GF(2ᵐ)
From MaRDI portal
Publication:394548
DOI10.1016/J.DISC.2013.12.020zbMATH Open1339.94088arXiv1310.1442OpenAlexW1540004955MaRDI QIDQ394548FDOQ394548
Authors: Cunsheng Ding, Zhengchun Zhou 
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
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, monomials and trinomials over finite fields with even characteristic are employed to construct a number of families of binary cyclic codes. Lower bounds on the minimum weight of some families of the cyclic codes are developed. The minimum weights of other families of the codes constructed in this paper are determined. The dimensions of the codes are flexible. Some of the codes presented in this paper are optimal or almost optimal in the sense that they meet some bounds on linear codes. Open problems regarding binary cyclic codes from monomials and trinomials are also presented.
Full work available at URL: https://arxiv.org/abs/1310.1442
Recommendations
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Combinatorial codes (94B25)
Cites Work
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
- Title not available (Why is that?)
- A Family of Two-Weight Irreducible Cyclic Codes
- The weight distribution of a class of \(p\)-ary cyclic codes
- On cyclic codes of length \(2^{2^r}-1\) with two zeros whose dual codes have three weights
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Fundamentals of Error-Correcting Codes
- The stability theory of stream ciphers
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Cyclic codes from some monomials and trinomials
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- On Self-Dual Cyclic Codes Over Finite Fields
- On decoding BCH codes
- Cyclic codes over \(\mathbb Z_4\) of even length
- Weil-Serre Type Bounds for Cyclic Codes
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- On the minimum distance of cyclic codes
- Minimum distance bounds for cyclic codes and Deligne's theorem
- A simple stream cipher with proven properties
- Is the class of cyclic codes asymptotically good?
- The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code
- Some long cyclic linear binary codes are not so bad
- A 2-adic approach to the analysis of cyclic codes
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
- Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns
- Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
- Long BCH codes are bad
Cited In (33)
- The circulant hash revisited
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Further results on permutation polynomials and complete permutation polynomials over finite fields
- A note on cyclic codes from APN functions
- Polycyclic codes associated with trinomials: good codes and open questions
- Some classes of permutation polynomials over finite fields with odd characteristic
- Generalized cyclotomic numbers of order two and their applications
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
- Cyclic codes from low differentially uniform functions
- A \(q\)-polynomial approach to cyclic codes
- Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\)
- Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)
- The \(c\)-boomerang uniformity of two classes of permutation polynomials over finite fields
- Recent results and problems on constructions of linear codes from cryptographic functions
- Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3
- Class of shortened cyclic codes over GF(28) for byte-oriented systems
- Several classes of permutation polynomials over the finite field \(\mathbb{F}_{p^{2 m}}\)
- Title not available (Why is that?)
- Binomial coefficient codes over GF(2)
- A sequence construction of cyclic codes over finite fields
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Constructing new piecewise differentially 4-uniform permutations from known APN functions
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- Construction of cyclic codes over ternary field from periodic sequences
- Two classes of binary cyclic codes and their weight distributions
- Binary cyclic codes from trinomials over GF(\(2^m\))
- Permutation polynomials and their compositional inverses over finite fields by a local method
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)
- Some cyclic codes from some monomials
This page was built for publication: Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394548)
