Linear complexity for multidimensional arrays - a numerical invariant

Linear complexity is a measure of how complex a one dimensional sequence can be. In this paper we extend the concept of linear complexity to multiple dimensions and present a definition that is invariant under well-orderings of the arrays. As a result we find that our new definition for the process...

Full description

Saved in:
Bibliographic Details
Main Authors: Gomez-Perez, Domingo, Hoholdt, Tom, Moreno, Oscar, Rubio, Ivelisse
Format: Conference Proceeding
Language:English
Subjects:
Arrays
Asymptotic properties
Complexity
Complexity theory
Correlation
Digital watermarking
Dimensional measurements
Groebner bases
Information theory
invariance
Invariants
Lead
linear complexity
Polynomials
Three-dimensional displays
Watermarking
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Linear complexity is a measure of how complex a one dimensional sequence can be. In this paper we extend the concept of linear complexity to multiple dimensions and present a definition that is invariant under well-orderings of the arrays. As a result we find that our new definition for the process introduced in the patent titled "Digital Watermarking" produces arrays with good asymptotic properties.
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2015.7282946