Minimum linear span approximation of binary sequences

DOI10.1109/TIT.2002.802621MaRDI QIDQ4677596zbMATH OpenOpenAlexFDO

Authors Panagiotis Rizomiliotis, Nicholas Kolokotronis, N. Kalouptsidis

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2002.802621

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 5150220
• scientific article; zbMATH DE number 4039793
• scientific article; zbMATH DE number 1972845
• Minimum degree and density of binary sequences
• The Linear Complexity of Binary Sequences With Optimal Autocorrelation
• Bounds on the linear span of bent sequences
• Results on the Nonlinear Span of Binary Sequences
• Linear complexity profile of binary sequences with small correlation measure
• A note on the minimal binary linear code
• scientific article; zbMATH DE number 1071799

Cited in

(7)

• On the Quadratic Span of Binary Sequences
• scientific article; zbMATH DE number 1972845 (Why is no real title available?)
• Constructing Periodic Binary Sequences With Maximum Nonlinear Span
• Recursive binary sequences of differences
• Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
• Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
• Minimum degree and density of binary sequences

This page was built for publication: Minimum linear span approximation of binary sequences

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