Intersection of Hamming codes avoiding Hamming subcodes
From MaRDI portal
Publication:663473
DOI10.1007/s10623-011-9506-0zbMath1235.94068OpenAlexW2038469373MaRDI QIDQ663473
Josep Rifà, Faina I. Solov'eva, Mercè Villanueva
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9506-0
Cryptography (94A60) Combinatorial aspects of finite geometries (05B25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering radius and the chromatic number of Kneser graphs
- On the classification of APN functions up to dimension five
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- On the covering radius of subcodes of a code
- Perfect nonlinear S-boxes
- On tactical configurations and error-correcting codes
This page was built for publication: Intersection of Hamming codes avoiding Hamming subcodes