Some q-ary cyclic codes from explicit monomials over F_q^m
From MaRDI portal
Publication:2190903
Recommendations
Cites work
- A 2-adic approach to the analysis of cyclic codes
- A Family of Two-Weight Irreducible Cyclic Codes
- A note on cyclic codes from APN functions
- A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences
- A sequence construction of cyclic codes over finite fields
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
- Cyclic codes from some monomials and trinomials
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Fundamentals of Error-Correcting Codes
- Is the class of cyclic codes asymptotically good?
- Minimum distance bounds for cyclic codes and Deligne's theorem
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- On cyclic self-dual codes
- On decoding BCH codes
- On the minimum distance of cyclic codes
- Optimal Ternary Cyclic Codes From Monomials
- Searching for linear codes with large minimum distance
- Some cyclic codes from some monomials
- Some long cyclic linear binary codes are not so bad
- The stability theory of stream ciphers
- The weight distribution of a class of p-ary cyclic codes
- The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
Cited in
(16)- 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} \)
- New developments in \(q\)-polynomial codes
- scientific article; zbMATH DE number 1188994 (Why is no real title available?)
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Cyclic codes from some monomials and trinomials
- Cyclic codes from low differentially uniform functions
- 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
- Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
- Infinite families of \(\mathrm{t}\)-error-correcting binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- A note on cyclic codes from APN functions
This page was built for publication: Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190903)
