This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost …
A Winterhof - Selected topics in information and coding theory, 2010 - World Scientific
The linear complexity of a sequence is not only a measure for the unpredictability and thus suitability for cryptography but also of interest in information theory because of its close …
R Hofer, A Winterhof - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
Hu introduced a simple method to compute the 2-adic complexity of any periodic binary sequence with ideal two-level autocorrelation. We extend this approach to some other …
N Brandstätter, A Winterhof - Periodica Mathematica Hungarica, 2006 - Springer
A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of …
M Yang, K Feng - arXiv preprint arXiv:2007.15327, 2020 - arxiv.org
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The …
T Yan, X Du, G Xiao, X Huang - Information Sciences, 2009 - Elsevier
Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2k - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …
M Su, A Winterhof - IEEE Transactions on Information Theory, 2010 - ieeexplore.ieee.org
We combine the concepts of the p-periodic Legendre sequence, the (q-1)-periodic Sidelnikov sequence and the two-prime generator to introduce a new p (q-1)-periodic …
IS Kotsireas, A Winterhof - International Conference on New Advances in …, 2022 - Springer
Quaternary Legendre Pairs | SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Download book …