Linear complexity for multidimensional arrays - a numerical invariant

Domingo Gomez-Perez; Tom Høholdt; Oscar Moreno; Ivelisse Rubio

doi:10.1109/ISIT.2015.7282946

Linear complexity for multidimensional arrays - a numerical invariant

Domingo Gomez-Perez, Tom Høholdt, Oscar Moreno, Ivelisse Rubio

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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	https://doi.org/10.1109/ISIT.2015.7282946
Publication status	Published - 2015
Event	IEEE International Symposium on Information Theory (ISIT 2015) - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015 http://www.isit2015.org/

Conference

Conference	IEEE International Symposium on Information Theory (ISIT 2015)
Country	Hong Kong
City	Hong Kong
Period	14/06/2015 → 19/06/2015
Internet address	http://www.isit2015.org/

Keywords

Linear complexity
Invariance
Groebner base
Correlatio
Arrays
Watermarking

Access to Document

10.1109/ISIT.2015.7282946

Fingerprint Dive into the research topics of 'Linear complexity for multidimensional arrays - a numerical invariant'. Together they form a unique fingerprint.

Cite this

@inproceedings{026d7959a67343bfb844030eb5dd6f59,

title = "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.",

keywords = "Linear complexity, Invariance, Groebner base, Correlatio, Arrays, Watermarking",

author = "Domingo Gomez-Perez and Tom H{\o}holdt and Oscar Moreno and Ivelisse Rubio",

year = "2015",

doi = "10.1109/ISIT.2015.7282946",

language = "English",

isbn = "978-1-4673-7704-1",

pages = "2697--2701",

booktitle = "Proceedings of the IEEE International Symposium on Information Theory (ISIT 2015)",

publisher = "IEEE",

address = "United States",

note = "IEEE International Symposium on Information Theory (ISIT 2015), ISIT ; Conference date: 14-06-2015 Through 19-06-2015",

url = "http://www.isit2015.org/",

}

Gomez-Perez, D, Høholdt, T, Moreno, O & Rubio, I 2015, Linear complexity for multidimensional arrays - a numerical invariant. in Proceedings of the IEEE International Symposium on Information Theory (ISIT 2015). IEEE, pp. 2697-2701, IEEE International Symposium on Information Theory (ISIT 2015), Hong Kong, Hong Kong, 14/06/2015. https://doi.org/10.1109/ISIT.2015.7282946

TY - GEN

T1 - Linear complexity for multidimensional arrays - a numerical invariant

AU - Gomez-Perez, Domingo

AU - Høholdt, Tom

AU - Moreno, Oscar

AU - Rubio, Ivelisse

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Linear complexity

KW - Invariance

KW - Groebner base

KW - Correlatio

KW - Arrays

KW - Watermarking

U2 - 10.1109/ISIT.2015.7282946

DO - 10.1109/ISIT.2015.7282946

M3 - Article in proceedings

SN - 978-1-4673-7704-1

SP - 2697

EP - 2701

BT - Proceedings of the IEEE International Symposium on Information Theory (ISIT 2015)

PB - IEEE

T2 - IEEE International Symposium on Information Theory (ISIT 2015)

Y2 - 14 June 2015 through 19 June 2015

ER -