A complexity measure for families of binary sequences

From MaRDI portal
Publication:1878610

DOI10.1023/A:1025962825241zbMath1050.11069OpenAlexW1859386033MaRDI QIDQ1878610

Christian Mauduit, Levon H. Khachatrian, Rudolf Ahlswede, András Sárközy

Publication date: 7 September 2004

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025962825241




Related Items (21)

Family complexity and cross-correlation measure for families of binary sequencesA new lower bound on the family complexity of Legendre sequencesOn the correlation of families of pseudorandom sequences of $k$ symbolsFamilies of Pseudorandom Binary Sequences with Low Cross-Correlation MeasureConstruction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). IIOn pseudorandom properties of some Dirichlet charactersOn the complexity of families of pseudo-random subsetsOn pseudorandomness in families of sequences derived from the Legendre symbolOn finite pseudorandom binary latticesOn pseudorandomness of families of binary sequencesFamily Complexity and VC-DimensionOn the complexity of a family of Legendre sequences with irreducible polynomialsOn large families of subsets of the set of the integers not exceeding \(N\)A technique to study the correlation measures of binary sequencesConstructions of pseudorandom binary lattices using cyclotomic classes in finite fieldsConstruction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)Concatenation of pseudorandom binary sequencesOn a family of pseudorandom binary sequencesOn the complexity of a family related to the Legendre symbolLarge families of pseudorandom sequences of k symbols and their complexity, Part IILarge families of pseudorandom sequences of k symbols and their complexity, Part I



Cites Work


This page was built for publication: A complexity measure for families of binary sequences