On the linear complexity for multidimensional sequences

From MaRDI portal
Publication:1791680

DOI10.1016/J.JCO.2018.07.003zbMATH Open1420.94029arXiv1803.03912OpenAlexW2883884985WikidataQ129486992 ScholiaQ129486992MaRDI QIDQ1791680FDOQ1791680

Andrew Tirkel, Domingo Gómez-Pérez, Min Sha

Publication date: 11 October 2018

Published in: Journal of Complexity (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1803.03912





Cites Work


Cited In (8)






This page was built for publication: On the linear complexity for multidimensional sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791680)