Binary cyclic codes from explicit polynomials over GF(2ᵐ)
From MaRDI portal
Publication:394548
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.
Recommendations
Cites work
- A 2-adic approach to the analysis of cyclic codes
- A Family of Two-Weight Irreducible Cyclic Codes
- A simple stream cipher with proven properties
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets
- Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
- Cyclic codes from some monomials and trinomials
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 1284434 (Why is no real title available?)
- Is the class of cyclic codes asymptotically good?
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Long BCH codes are bad
- Minimum distance bounds for cyclic codes and Deligne's theorem
- On cyclic codes of length \(2^{2^r}-1\) with two zeros whose dual codes have three weights
- On decoding BCH codes
- On Self-Dual Cyclic Codes Over Finite Fields
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
- On the minimum distance of cyclic codes
- Some long cyclic linear binary codes are not so bad
- The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code
- The stability theory of stream ciphers
- The weight distribution of a class of p-ary cyclic codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Weil-Serre Type Bounds for Cyclic Codes
Cited in
(47)- Binomial coefficient codes over GF(2)
- Some classes of permutation polynomials over finite fields with odd characteristic
- A sequence construction of cyclic codes over finite fields
- A \(q\)-polynomial approach to cyclic codes
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)
- Two classes of binary cyclic codes and their weight distributions
- The circulant hash revisited
- Recent results and problems on constructions of linear codes from cryptographic functions
- Polycyclic codes associated with trinomials: good codes and open questions
- Further results on permutation polynomials and complete permutation polynomials over finite fields
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Construction of cyclic codes over ternary field from periodic sequences
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Constructing new piecewise differentially 4-uniform permutations from known APN functions
- scientific article; zbMATH DE number 6692168 (Why is no real title available?)
- Binary cyclic codes from trinomials over GF(2ᵐ)
- Generalized cyclotomic numbers of order two and their applications
- Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\)
- Class of shortened cyclic codes over GF(28) for byte-oriented systems
- 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>
- Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday
- Permutation polynomials and their compositional inverses over finite fields by a local method
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Several classes of permutation polynomials over the finite field \(\mathbb{F}_{p^{2 m}}\)
- Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)
- Cyclic codes from low differentially uniform functions
- The c-boomerang uniformity of two classes of permutation polynomials over finite fields
- Some cyclic codes from some monomials
- Binary cyclic codes from three classes of sequences
- Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials
- Several classes of permutation polynomials over \(\mathbb{F}_{p^{2m}}\) with odd characteristic based on the AGW criterion
- The compositional inverses of the permutation polynomials from trace functions over finite fields
- Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
- The compositional inverses of permutation polynomials of the form \(\sum_{i = 1}^k b_i (x^{p^m} + x + \delta )^{s_i} - x\) over \(\mathbb{F}_{p^{2 m}}\)
- Algebraic structure of permutational polynomials over Fqn
- Some classes of functions with low c-differential uniformity over finite fields
- The \(c\)-boomerang uniformity and \(c\)-boomerang spectrum of two classes of permutation polynomials over the finite field \(\mathbb{F}_{2^n}\)
- Three families of binary cyclic codes with good lower bounds
- The study on three classes of permutation quadrinomials over finite fields of odd characteristic
- Binary \([n,(n \pm 1)/2]\) cyclic codes with good minimum distances from sequences
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- A construction of permutation polynomials using Rédei function in even characteristic
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
- A note on cyclic codes from APN functions
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)
