A new class of security oriented error correcting robust codes
From MaRDI portal
Publication:2325296
DOI10.1007/s12095-018-0340-3zbMath1419.94091OpenAlexW2899947037MaRDI QIDQ2325296
Publication date: 25 September 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0340-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linearization of logical functions defined by a set of orthogonal terms. I: Theoretical aspects
- A new construction of minimum distance robust codes
- Highly nonlinear mappings
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Kernels of nonlinear Hamming codes
- Robust Generalized Punctured Cubic Codes
- A Combinatorial Construction of Perfect Codes
- New classes of almost bent and almost perfect nonlinear polynomials
- New Class of Nonlinear Systematic Error Detecting Codes
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Secure Integrated Circuits and Systems
- Non-Malleable Codes
- Perfect binary codes: constructions, properties, and enumeration
- A Comment on the Karpovsky–Taubin Code
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- 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.)
This page was built for publication: A new class of security oriented error correcting robust codes