On the linear complexity for multidimensional sequences

Domingo Gomez Perez, Min Sha*, Andrew Tirkel

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and k-error linear complexity of multidimensional periodic sequences.

Original languageEnglish
Pages (from-to)46-55
Number of pages10
JournalJournal of Complexity
Volume49
DOIs
Publication statusPublished - Dec 2018

Keywords

  • k-error linear complexity
  • Linear complexity
  • Multidimensional sequence

Fingerprint

Dive into the research topics of 'On the linear complexity for multidimensional sequences'. Together they form a unique fingerprint.

Cite this