Quasi-perfect linear codes from planar and APN functions
- 16 April 2015
- journal article
- Published by Springer Nature in Cryptography and Communications
- Vol. 8 (2) , 215-227
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Further results on planar DO functions and commutative semifieldsDesigns, Codes and Cryptography, 2011
- A family of constacyclic ternary quasi-perfect codes with covering radius 3Designs, Codes and Cryptography, 2010
- Commutative semifields from projection mappingsDesigns, Codes and Cryptography, 2010
- New semifields, PN and APN functionsDesigns, Codes and Cryptography, 2009
- A new almost perfect nonlinear function which is not quadraticAdvances in Mathematics of Communications, 2009
- New families of quadratic almost perfect nonlinear trinomials and multinomialsFinite Fields and Their Applications, 2008
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing SchemesIEEE Transactions on Information Theory, 2005
- Divisibility properties for covering radius of certain cyclic codesIEEE Transactions on Information Theory, 2003
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjectureIEEE Transactions on Information Theory, 2000
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)IEEE Transactions on Information Theory, 1968