On the triple-error-correcting cyclic codes with zero set \1, 2ⁱ+1, 2ʲ+ 1\
From MaRDI portal
Publication:3104686
DOI10.1007/978-3-642-25516-8_6zbMATH Open1291.94203OpenAlexW188352799MaRDI QIDQ3104686FDOQ3104686
Authors: Vincent Herbert, Sumanta Sarkar
Publication date: 16 December 2011
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25516-8_6
Recommendations
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- The weight distributions of a class of cyclic codes with three nonzeros over \(\mathbb{F}_3\)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
- On binary cyclic codes with minimum distance \(d=3\).
- On the error-correcting performance of some binary and ternary linear codes
Cites Work
- Algebraic Codes for Data Transmission
- On a class of error correcting binary group codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Generalizations of the BCH bound
- On \(x^{q+1}+ax+b\)
- Title not available (Why is that?)
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Title not available (Why is that?)
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the minimum distance of cyclic codes
- A new lower bound for the minimum distance of a cyclic code
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
- Computing automorphism groups of error-correcting codes
- Title not available (Why is that?)
- Bounds on the minimum distance of the duals of BCH codes
- Non-BCH triple-error-correcting codes
Cited In (5)
- The weight distributions of two classes of binary cyclic codes
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- Bound for mixed exponential sums associated to binary good cyclic codes
- Optimal covering polynomial sets correcting three errors for binary cyclic codes
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
This page was built for publication: On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104686)