Optimal p-ary cyclic codes with minimum distance four from monomials
- 3 October 2015
- journal article
- Published by Springer Nature in Cryptography and Communications
- Vol. 8 (4) , 541-554
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- New families of APN functions in characteristic 3 or 52012
- A triple-error-correcting cyclic code from the Gold and Kasami–Welch APN power functionsFinite Fields and Their Applications, 2012
- Planar functions and commutative semifieldsTatra Mountains Mathematical Publications, 2010
- Vectorial Boolean Functions for Cryptography2010
- The weight distribution of a class of p-ary cyclic codesFinite Fields and Their Applications, 2010
- New semifields, PN and APN functionsDesigns, Codes and Cryptography, 2009
- Perfect nonlinear binomials and their semifieldsFinite Fields and Their Applications, 2009
- A family of skew Hadamard difference setsJournal of Combinatorial Theory, Series A, 2006
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing SchemesIEEE Transactions on Information Theory, 2005
- New families of almost perfect nonlinear power mappingsIEEE Transactions on Information Theory, 1999