An alternate characterization of the bentness of binary functions, with uniqueness
From MaRDI portal
Publication:1389149
DOI10.1023/A:1008283912025zbMATH Open0956.94008MaRDI QIDQ1389149FDOQ1389149
Authors: Claude Carlet, Philippe Guillot
Publication date: 18 March 2001
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+function&go=Go M��bius function]Boolean functionbinary bent functions
Cited In (10)
- A characterization of binary bent functions
- Highly nonlinear mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bent and generalized bent Boolean functions
- Completed \({\mathcal {GPS}}\) covers all bent functions
- Title not available (Why is that?)
- Generalization of cross-correlation in Boolean functions and some generalized constructions in gbent functions
- Four decades of research on bent functions
- Bent functions embedded into the recursive framework of \(\mathbb{Z}\)-bent functions
This page was built for publication: An alternate characterization of the bentness of binary functions, with uniqueness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389149)