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.
Original language | English |
---|---|
Title of host publication | Proceedings of the IEEE International Symposium on Information Theory (ISIT 2015) |
Publisher | IEEE |
Publication date | 2015 |
Pages | 2697-2701 |
ISBN (Print) | 978-1-4673-7704-1 |
DOIs | |
Publication status | Published - 2015 |
Event | 2015 IEEE International Symposium on Information Theory - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015 http://www.isit2015.org/ |
Conference
Conference | 2015 IEEE International Symposium on Information Theory |
---|---|
Country/Territory | Hong Kong |
City | Hong Kong |
Period | 14/06/2015 → 19/06/2015 |
Internet address |
Keywords
- Linear complexity
- Invariance
- Groebner base
- Correlatio
- Arrays
- Watermarking