A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
From MaRDI portal
Publication:2248644
DOI10.1007/s10623-012-9763-6zbMath1333.94065OpenAlexW1986274407MaRDI QIDQ2248644
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9763-6
Uses Software
Cites Work
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- An alternative proof of a result on the weight divisibility of a cyclic code using supersingular curves
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- The Magma algebra system. I: The user language
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Another proof of Kasami's theorem
- A new almost perfect nonlinear function which is not quadratic
- On a class of error correcting binary group codes
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- 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
- Determining the Nonlinearity of a New Family of APN Functions
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
