Bent functions S Mesnager, Mesnager Springer International Publishing, 2016 | 340 | 2016 |
Four decades of research on bent functions C Carlet, S Mesnager Designs, codes and cryptography 78 (1), 5-50, 2016 | 236 | 2016 |
Linear Codes Over Are Equivalent to LCD Codes for C Carlet, S Mesnager, C Tang, Y Qi, R Pellikaan IEEE Transactions on Information Theory 64 (4), 3010-3017, 2018 | 215 | 2018 |
Several new infinite families of bent functions and their duals S Mesnager IEEE Transactions on Information Theory 60 (7), 4397-4407, 2014 | 134 | 2014 |
Euclidean and Hermitian LCD MDS codes C Carlet, S Mesnager, C Tang, Y Qi Designs, Codes and Cryptography 86, 2605-2618, 2018 | 126 | 2018 |
On Dillonʼs class H of bent functions, Niho bent functions and o-polynomials C Carlet, S Mesnager Journal of Combinatorial Theory, Series A 118 (8), 2392-2410, 2011 | 117 | 2011 |
Linear codes with few weights from weakly regular bent functions based on a generic construction S Mesnager Cryptography and Communications 9, 71-84, 2017 | 110 | 2017 |
Several classes of minimal linear codes with few weights from weakly regular plateaued functions S Mesnager, A Sınak IEEE Transactions on Information Theory 66 (4), 2296-2310, 2019 | 85 | 2019 |
Improving the upper bounds on the covering radii of binary Reed–Muller codes C Carlet, S Mesnager IEEE Transactions on Information Theory 53 (1), 162-173, 2006 | 85 | 2006 |
Bent and hyper-bent functions in polynomial form and their link with some exponential sums and Dickson polynomials S Mesnager IEEE transactions on information theory 57 (9), 5996-6009, 2011 | 82 | 2011 |
Complementary dual algebraic geometry codes S Mesnager, C Tang, Y Qi IEEE Transactions on Information Theory 64 (4), 2390-2397, 2017 | 80 | 2017 |
On minimal and quasi-minimal linear codes GD Cohen, S Mesnager, A Patey Cryptography and Coding: 14th IMA International Conference, IMACC 2013 …, 2013 | 79 | 2013 |
A new class of bent and hyper-bent Boolean functions in polynomial forms S Mesnager Designs, Codes and Cryptography 59 (1), 265-279, 2011 | 78 | 2011 |
Linear codes from weakly regular plateaued functions and their secret sharing schemes S Mesnager, F Özbudak, A Sınak Designs, Codes and Cryptography 87 (2), 463-480, 2019 | 75 | 2019 |
Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity S Mesnager IEEE Transactions on Information Theory 54 (8), 3656-3662, 2008 | 72 | 2008 |
New characterization and parametrization of LCD codes C Carlet, S Mesnager, C Tang, Y Qi IEEE Transactions on Information Theory 65 (1), 39-49, 2018 | 71 | 2018 |
A new family of hyper-bent Boolean functions in polynomial form S Mesnager IMA International Conference on Cryptography and Coding, 402-417, 2009 | 65 | 2009 |
Involutions Over the Galois Field P Charpin, S Mesnager, S Sarkar IEEE Transactions on Information Theory 62 (4), 2266-2276, 2016 | 62 | 2016 |
New constructions of optimal locally recoverable codes via good polynomials J Liu, S Mesnager, L Chen IEEE Transactions on Information Theory 64 (2), 889-899, 2017 | 55 | 2017 |
Secret-sharing schemes based on self-dual codes ST Dougherty, S Mesnager, P Sole 2008 IEEE information theory workshop, 338-342, 2008 | 53 | 2008 |