A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
From MaRDI portal
Publication:2248644
DOI10.1007/S10623-012-9763-6zbMATH Open1333.94065OpenAlexW1986274407MaRDI QIDQ2248644FDOQ2248644
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
Recommendations
- On the minimum distances of non-binary cyclic codes
- Non-BCH triple-error-correcting codes
- Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
- Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
- A new procedure for decoding cyclic and BCH codes up to actual minimum distance
- On the minimum distance of ternary cyclic codes
- Addendum to "Non-BCH triple-error-correcting codes"
- On the undetected error probability of triple-error-correcting BCH codes
- The minimum distance of some narrow-sense primitive BCH codes
- On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
Cites Work
- The Magma algebra system. I: The user language
- A new almost perfect nonlinear function which is not quadratic
- Title not available (Why is that?)
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Title not available (Why is that?)
- On a class of error correcting binary group codes
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Determining the Nonlinearity of a New Family of APN Functions
- 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.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- Title not available (Why is that?)
- On the minimum distance of cyclic codes
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
- Another proof of Kasami's theorem
- An alternative proof of a result on the weight divisibility of a cyclic code using supersingular curves
Cited In (4)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
Uses Software
This page was built for publication: A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248644)
