Conference paper
Linear complexity for multidimensional arrays - a numerical invariant
Abstract
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.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2015 |
| Pages: | 2697-2701 |
| Proceedings: | 2015 IEEE International Symposium on Information Theory |
| ISBN: | 1467377031 , 146737704X , 146737704x , 1467377058 , 9781467377034 , 9781467377041 and 9781467377058 |
| ISSN: | 21578117 and 21578095 |
| Types: | Conference paper |
| DOI: | 10.1109/ISIT.2015.7282946 |
