On the linear complexity for multidimensional sequences

DOI10.1016/J.JCO.2018.07.003MaRDI QIDQ1791680zbMATH OpenOpenAlexWikidataFDO

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

Publication date 11 October 2018

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

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

zbMATH Keywords

linear complexity\(k\)-error linear complexitymultidimensional sequence

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Multiple sequences and series (40B05)

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.

Recommendations

• Periodic multisequences with large error linear complexity
• Improved results on periodic multisequences with large error linear complexity
• Error linear complexity measures for multisequences
• Multidimensional linear complexity analysis of periodic arrays
• The asymptotic normalized linear complexity of multisequences

Cites work

• scientific article; zbMATH DE number 1973372 (Why is no real title available?)
• scientific article; zbMATH DE number 1978271 (Why is no real title available?)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Doubly-periodic sequences and a class of two-dimensional cyclic codes
• Error linear complexity measures for multisequences
• Families of 3D Arrays for Video Watermarking
• General theory of doubly periodic arrays over an arbitrary finite field and its applications
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• New Optimal Low Correlation Sequences for Wireless Communications
• On linear complexity of binary lattices. II
• On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
• On the linear complexity of binary lattices
• Probability Inequalities for Sums of Bounded Random Variables
• The stability theory of stream ciphers

Cited in

(11)

• Multidimensional linear complexity analysis of periodic arrays
• Complexity of prime-dimensional sequences over a finite field
• On the linear complexity of multisequences, bijections between \(\mathbb Z\)ahlen and \(\mathbb N\)umber tuples, and partitions
• The asymptotic normalized linear complexity of multisequences
• scientific article; zbMATH DE number 672007 (Why is no real title available?)
• On Monge sequences in \(d\)-dimensional arrays
• Improved results on periodic multisequences with large error linear complexity
• On-line sorting of twisted sequences in linear time
• Analysis and computation of multidimensional linear complexity of periodic arrays
• On the Joint Linear Complexity of Linear Recurring Multisequences
• The asymptotic behavior of the joint linear complexity profile of multisequences

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)