Bounds on the linear span of bent sequences

DOI10.1109/TIT.1983.1056766MaRDI QIDQ3328462zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Bent functionsBent sequencesbinary sequencesBoolean functionsCDMA sequenceslinear spanm-sequencenonlinear sequencesshift-register sequence

Mathematics Subject Classification ID

Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Low-correlation, large linear span sequences from function fields
• Binary sequences with Gold-like correlation but larger linear span
• Generating bent sequences
• Large families of sequences with near-optimal correlations and large linear span
• Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span

Cited in

(12)

• Generating and counting a class of binary Bent sequences which is neither Bent-based nor linear-based
• Generating bent sequences
• Characteristic digit-sum sequences
• On the linear complexity of the sequences generated by nonlinear filterings
• On the linear span of the extended WG sequences
• On shift sequences for interleaved construction of signal sets with low correlation
• Linear spans of modified de Bruijn sequences
• Linear span analysis of a set of periodic sequence generators
• Minimum linear span approximation of binary 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328462)