On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}
From MaRDI portal
Publication:3104686
DOI10.1007/978-3-642-25516-8_6zbMath1291.94203OpenAlexW188352799MaRDI QIDQ3104686
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
Related Items
Bound for mixed exponential sums associated to binary good cyclic codes, The weight distributions of two classes of binary cyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(x^{q+1}+ax+b\)
- On a class of error correcting binary group codes
- A new lower bound for the minimum distance of a cyclic code
- Computing automorphism groups of error-correcting codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- On the minimum distance of cyclic codes
- Bounds on the minimum distance of the duals of BCH codes
- Non-BCH triple-error-correcting codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Generalizations of the BCH bound
- Algebraic Codes for Data Transmission
