New Matrices with Good Auto and Cross-Correlation

  title={New Matrices with Good Auto and Cross-Correlation},
  author={Andrew Z. Tirkel and Thomas E. Hall},
  journal={IEICE Trans. Fundam. Electron. Commun. Comput. Sci.},
  • A. Tirkel, T. Hall
  • Published 1 September 2006
  • Computer Science
  • IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Large sets of matrices with good auto and cross-correlation are rare. We present two such constructions, a method of extending family size by column multiplication and a method of extending physical size by interlacing. These matrices can be applied to digital watermarking of images. 

Figures and Tables from this paper

Double Periodic Arrays with Good Correlation for Applications in Watermarking

  • O. MorenoJ. Ortiz-Ubarri
  • Computer Science
    2007 3rd International Workshop on Signal Design and Its Applications in Communications
  • 2007
This paper presents a method that increases the number of sequences, and another that increasesThe number of ones keeping the correlation good and double-periodic, and combines both methods producing families of double- periodic arrays with good correlation and many dots.

Double Periodic Arrays with Optimal Correlation for Applications in Watermarking

This paper presents a method that increases the number of sequences, and another that increasesThe number of ones keeping the correlation good and double-periodic, and obtain two new constructions of Optical Orthogonal Codes.

Arrays composed from the extended rational cycle

A unified method of obtaining multivariate recursion polynomials and their footprints for all finite multidimensional arrays and shows that the size of the footprint is invariant under dimensional transformations based on the Chinese Remainder Theorem.

New families of asymptotically optimal doubly periodic arrays with ideal correlation constraints

These new families possess the same properties that make the Moreno-Maric construction suitable for communications systems and digital watermarking, size (q+1)×( q+1), weight ω=q-1, family size q−2, and correlation 2, where q is a power of a prime.

Multidimensional linear complexity analysis of periodic arrays

This paper uses Gröbner bases to develop a theory for analyzing the multidimensional linear complexity of general periodic arrays and analyzes arrays constructed using the method of composition to establish tight bounds for their multiddimensional linear complexity.

A new method to construct double periodic arrays with optimal correlation

Double-periodic arrays with good correlation are useful for applications in multiple target Costas and sonar, optical communications, and more recently digital watermarking. There are only a few

Group permutable constant weight codes

This work presents improvements to the Johnson Bound to bound the cardinality of the families of double-periodic arrays whose row and column length are not relatively prime and presents some families of group permutable constant weight codes and proves the optimality of these families.

Collusion resistant fingerprinting of digital audio

These fingerprints are resistant to an averaging collusion attack by hundreds or thousands of colluders, and can withstand a worst case RandNeg attack by up to 30 colluders.

New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems

New families of three-dimensional (3-D) optical orthogonal codes for applications to optical code-division multiple access (OCDMA) networks are presented, based in the extended rational cycle used for the 2-D Moreno-Maric construction.

New Optimal Low Correlation Sequences for Wireless Communications

Three new sets of frequency hopping sequences are presented, which are converted into sequences for CDMA, and one of the CDMA sequence families is optimal with respect to the Welch bound, and two are nearly optimal.



Families of Matrices with Good Auto and Cross-Correlation

A family of p-1 square p% p matrices whose periodic cross-correlation values are uniformly –p,0,+p is constructed, which has resulted in the superimposed embedding of twelve of the matrices in the standard image “Lenna” and their subs equent retrieval without recourse to the unmarked image.

Matrix construction using cyclic shifts of a column

  • A. TirkelT. Hall
  • Computer Science
    Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
  • 2005
The synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns, from shift sequences of m-arrays to produce arrays for watermarking of digital images is described.


An overview of pseudonoise patterns suitable for embedding in images for the purposes of information hiding, including some new constructions based on one-dimensional pseudonois sequences, whose fundamentals have been derived from communications and radar are presented.

A new family of frequency-hop codes

An algebraic construction is given for a new family of frequency-hop codes, which include a family of codes with a code length of a power of 2, which are ideally suitable for applications in digital communication systems.

A Unique Watermark for Every Image

This work proposes a scheme for watermarking images or video at the camera, each watermark is unique and identifies the owner, camera, and frame number.

On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function

Analogs of known existence tests for cyclic difference sets are applied to rule out existence for most nonprime values of n and it is shown how such patterns can be used to provide hopping patterns for a frequency-hopped multiple-access system.

Image and watermark registration

Periodic Sequences with Optimal Properties for Channel Estimation and Fast Start-Up Equalization

The problems of fast channel estimation and fast start-up equalization in synchronous digital communication systems are considered from the viewpoint of the optimization of the training sequence to

Design of a new family of two-dimensional codes for fiber-optic CDMA networks

These newly designed temporary/spatial single-pulse-per-row (T/S SPR) codes have out-of-phase autocorrelation zero and cross correlation equal to one and Optical orthogonal codes (OOCs) have the lowest out- of-phase Autocor correlation and cross-correlation values among the one-dimensional codes.

The Theory of Error-Correcting Codes