Bounds on the linear span of bent sequences
From MaRDI portal
Publication:3328462
DOI10.1109/TIT.1983.1056766zbMath0539.94031OpenAlexW2067062123MaRDI QIDQ3328462
P. Vijay Kumar, Robert A. Scholtz
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056766
binary sequencesBoolean functionsm-sequencelinear spanBent functionsshift-register sequencenonlinear sequencesBent sequencesCDMA sequences
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
On the linear complexity of the sequences generated by nonlinear filterings ⋮ Characteristic digit-sum sequences ⋮ Linear Span analysis of a set of periodic sequence generators ⋮ On shift sequences for interleaved construction of signal sets with low correlation ⋮ Generating bent sequences ⋮ A family of keystream generators with large linear complexity ⋮ An efficient algorithm to generate binary sequences for cryptographic purposes ⋮ A wide family of nonlinear filter functions with a large linear span
This page was built for publication: Bounds on the linear span of bent sequences
