Cyclic codes from some monomials and trinomials
From MaRDI portal
Publication:5408604
DOI10.1137/120882275zbMATH Open1306.94114OpenAlexW1999918393MaRDI QIDQ5408604FDOQ5408604
Authors: Cunsheng Ding
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120882275
Recommendations
- Some cyclic codes from some monomials
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property
- On the minimum distances of non-binary cyclic codes
- Binary cyclic codes from trinomials over GF(\(2^m\))
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cited In (41)
- Monomial-Cartesian codes closed under divisibility
- On some conjectures about optimal ternary cyclic codes
- New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)
- A class of optimal ternary cyclic codes and their duals
- On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Constructing permutation polynomials over \(\mathbb{F}_{q^3}\) from bijections \(\mathrm{PG}(2,q)\)
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- On the inverses of some classes of permutations of finite fields
- A survey on the applications of Niho exponents
- A note on cyclic codes from APN functions
- A link between two classes of permutation polynomials
- Polycyclic codes associated with trinomials: good codes and open questions
- Generalized Lucas polynomials over finite fields
- Further results on optimal ternary cyclic codes
- Cyclic codes from low differentially uniform functions
- New constructions of involutions over finite fields
- The Walsh transform of a class of monomial functions and cyclic codes
- On a sequence of cyclic codes with minimum distance six
- A general construction of regular complete permutation polynomials
- Title not available (Why is that?)
- Recent results and problems on constructions of linear codes from cryptographic functions
- Six New Classes of Permutation Trinomials over $\mathbb{F}_{2^{n}}$
- A new class of distance-optimal binary cyclic codes and their duals
- Extended framework for constructing (complete) permutations by specifying their coordinate functions
- New classes of permutation binomials and permutation trinomials over finite fields
- Cyclic Codes from APN and Planar Functions
- New classes of optimal ternary cyclic codes with minimum distance four
- On the Ding and Helleseth's 7th open problem about optimal ternary cyclic codes
- New constructions of permutation polynomials of the form \(x + \gamma \operatorname{Tr}_q^{q^2}(h(x))\) over finite fields with even characteristic
- A sequence construction of cyclic codes over finite fields
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Dembowski-Ostrom polynomials from reversed Dickson polynomials
- 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
- On an open problem about a class of optimal ternary cyclic codes
- New permutation trinomials constructed from fractional polynomials
- Binary cyclic codes from trinomials over GF(\(2^m\))
- Compositional inverses and complete mappings over finite fields
- Permutation polynomials and their compositional inverses over finite fields by a local method
- Some cyclic codes from some monomials
This page was built for publication: Cyclic codes from some monomials and trinomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408604)