Generating and counting binary bent sequences
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (5) , 1170-1173
- https://doi.org/10.1109/18.57222
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Nonlinearity Criteria for Cryptographic FunctionsPublished by Springer Nature ,2001
- A new general construction for generalized bent functionsIEEE Transactions on Information Theory, 1989
- Analysis and synthesis of bent sequencesIEE Proceedings E Computers and Digital Techniques, 1989
- Generalized bent functions and their propertiesJournal of Combinatorial Theory, Series A, 1985
- Bounds on the linear span of bent sequencesIEEE Transactions on Information Theory, 1983
- Maximal families of bent sequencesIEEE Transactions on Information Theory, 1982
- Bent-function sequencesIEEE Transactions on Information Theory, 1982
- A note on the eigenvectors of Hadamard matrices of order 2nLinear Algebra and its Applications, 1982
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976
- A family of difference sets in non-cyclic groupsJournal of Combinatorial Theory, Series A, 1973