Team for Research in
Ubiquitous Secure Technology

Citation
Venkat Anantharam. "A technique to study the correlation measures of binary sequences". Unpublished article, November, 2005; Submitted for publication to ``Discrete Mathematics" in November 2005.

Abstract
Mauduit and Sarkozy defined a family of correlation measures for binary sequences. These correlation measures have been extensively studied over the last decade in several papers by many authors. They are of interest in evaluating the pseudorandomness properties of binary sequences for cryptographic applications. We resolve a conjecture of Mauduit regarding these correlation measures. Specifically, we prove that there is a universal constant such that the product of the third and the second correlation measures of a binary sequence of length n is always lower bounded by this constant times n. The new techniques introduced in the process of proving this conjecture can be used to shed further light on the properties of the correlation measure of Mauduit and Sarkozy.

Electronic downloads

• http://www.eecs.berkeley.edu/~ananth/2005+/Self/CorrelationMeasures.pdf

• HTML

  Venkat Anantharam. <a
  href="http://www.truststc.org/pubs/55.html"
  ><i>A technique to study the correlation measures
  of binary sequences</i></a>, Unpublished
  article,  November, 2005; 
  
   Submitted for publication to
  ``Discrete Mathematics" in November 2005.

• Plain text

  Venkat Anantharam. "A technique to study the
  correlation measures of binary sequences". Unpublished
  article,  November, 2005; 
  
   Submitted for publication to
  ``Discrete Mathematics" in November 2005.

• BibTeX

  @unpublished{Anantharam05_TechniqueToStudyCorrelationMeasuresOfBinarySequences,
      author = {Venkat Anantharam},
      title = {A technique to study the correlation measures of
                binary sequences},
      month = {November},
      year = {2005},
      note = {
  
   Submitted for publication to ``Discrete
                Mathematics" in November 2005.},
      abstract = { Mauduit and Sarkozy defined a family of
                correlation measures for binary sequences. These
                correlation measures have been extensively studied
                over the last decade in several papers by many
                authors. They are of interest in evaluating the
                pseudorandomness properties of binary sequences
                for cryptographic applications. We resolve a
                conjecture of Mauduit regarding these correlation
                measures. Specifically, we prove that there is a
                universal constant such that the product of the
                third and the second correlation measures of a
                binary sequence of length n is always lower
                bounded by this constant times n. The new
                techniques introduced in the process of proving
                this conjecture can be used to shed further light
                on the properties of the correlation measure of
                Mauduit and Sarkozy.},
      URL = {http://www.truststc.org/pubs/55.html}
  }
  

Posted by Venkatachalam Anantharam on 13 Apr 2006.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.