On linear complexity of binary lattices, II

Katalin Gyarmati, Christian Mauduit, A. Sárközy

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The linear complexity is an important and frequently used measure of unpredictably and pseudorandomness of binary sequences. In Part I of this paper, we extended this notion to two dimensions: we defined and studied the linear complexity of binary and bit lattices. In this paper, first we will estimate the linear complexity of a truly random bit (M,N)-lattice. Next we will extend the notion of k-error linear complexity to bit lattices. Finally, we will present another alternative definition of linear complexity of bit lattices.

Original languageEnglish
Pages (from-to)237-263
Number of pages27
JournalRamanujan Journal
Volume34
Issue number2
DOIs
Publication statusPublished - 2014

Fingerprint

Linear Complexity
Binary
Pseudorandomness
Binary Sequences
Two Dimensions
Alternatives
Estimate

Keywords

  • Binary lattice
  • Linear complexity
  • Linear recursion
  • Pseudorandomness
  • Two dimensions

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

On linear complexity of binary lattices, II. / Gyarmati, Katalin; Mauduit, Christian; Sárközy, A.

In: Ramanujan Journal, Vol. 34, No. 2, 2014, p. 237-263.

Research output: Contribution to journalArticle

Gyarmati, Katalin ; Mauduit, Christian ; Sárközy, A. / On linear complexity of binary lattices, II. In: Ramanujan Journal. 2014 ; Vol. 34, No. 2. pp. 237-263.
@article{54ed056ca45b414a8d8cfb0a129743d8,
title = "On linear complexity of binary lattices, II",
abstract = "The linear complexity is an important and frequently used measure of unpredictably and pseudorandomness of binary sequences. In Part I of this paper, we extended this notion to two dimensions: we defined and studied the linear complexity of binary and bit lattices. In this paper, first we will estimate the linear complexity of a truly random bit (M,N)-lattice. Next we will extend the notion of k-error linear complexity to bit lattices. Finally, we will present another alternative definition of linear complexity of bit lattices.",
keywords = "Binary lattice, Linear complexity, Linear recursion, Pseudorandomness, Two dimensions",
author = "Katalin Gyarmati and Christian Mauduit and A. S{\'a}rk{\"o}zy",
year = "2014",
doi = "10.1007/s11139-013-9500-4",
language = "English",
volume = "34",
pages = "237--263",
journal = "Ramanujan Journal",
issn = "1382-4090",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - On linear complexity of binary lattices, II

AU - Gyarmati, Katalin

AU - Mauduit, Christian

AU - Sárközy, A.

PY - 2014

Y1 - 2014

N2 - The linear complexity is an important and frequently used measure of unpredictably and pseudorandomness of binary sequences. In Part I of this paper, we extended this notion to two dimensions: we defined and studied the linear complexity of binary and bit lattices. In this paper, first we will estimate the linear complexity of a truly random bit (M,N)-lattice. Next we will extend the notion of k-error linear complexity to bit lattices. Finally, we will present another alternative definition of linear complexity of bit lattices.

AB - The linear complexity is an important and frequently used measure of unpredictably and pseudorandomness of binary sequences. In Part I of this paper, we extended this notion to two dimensions: we defined and studied the linear complexity of binary and bit lattices. In this paper, first we will estimate the linear complexity of a truly random bit (M,N)-lattice. Next we will extend the notion of k-error linear complexity to bit lattices. Finally, we will present another alternative definition of linear complexity of bit lattices.

KW - Binary lattice

KW - Linear complexity

KW - Linear recursion

KW - Pseudorandomness

KW - Two dimensions

UR - http://www.scopus.com/inward/record.url?scp=84900827358&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84900827358&partnerID=8YFLogxK

U2 - 10.1007/s11139-013-9500-4

DO - 10.1007/s11139-013-9500-4

M3 - Article

VL - 34

SP - 237

EP - 263

JO - Ramanujan Journal

JF - Ramanujan Journal

SN - 1382-4090

IS - 2

ER -