Searching. Please wait…
1580
37
171
29348
4420
2606
347
392
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. © 2018 Elsevier Inc.
Fuente: JournalofComplexity49(2018)46?55
Publisher: Academic Press Inc.
Publication date: 01/12/2018
No. of pages: 17
Publication type: Article
DOI: 10.1016/j.jco.2018.07.003
ISSN: 0885-064X,1090-2708
Spanish project: MTM2014-55421-P
Publication Url: https://doi.org/10.1016/j.jco.2018.07.003
Citations in Google Scholar
Read publication
DOMINGO GOMEZ PEREZ
SHA, MIN
TIRKEL, ANDREW
Back