An algebra of arrays and almost perfect watermarks

DOI10.1007/s12095-015-0123-zzbMath1343.94023OpenAlexW2068061856MaRDI QIDQ892498

Nathan Jolly

Publication date: 19 November 2015

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0123-z

zbMATH Keywords

autocorrelationalmost perfect arrayswatermarks

Mathematics Subject Classification ID

Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)

Related Items (1)

A new family of arrays with low autocorrelation

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Fourier transform and convolution algorithms
• Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.
• Perfect arrays of unbounded sizes over the basic quaternions
• A new family of frequency-hop codes
• Two-dimensional perfect quaternary arrays
• Theory and applications of q-ary interleaved sequences
• On the synthesis of two-dimensional arrays with desirable correlation properties

This page was built for publication: An algebra of arrays and almost perfect watermarks