Matrix Construction Using Cyclic Shifts of a Column

Simple item page
dc.creatorTirkel, Andrew Z
dc.creatorHall, Tom E
dc.date2005-08-02
dc.date.accessioned2026-07-07T08:15:33Z
dc.date.available2026-07-07T08:15:33Z
dc.descriptionThis paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the constant (or almost constant) difference property are: Quadratic (Polynomial) and Reciprocal Shift modulo prime, Exponential Shift, Legendre Shift, Zech Logarithm Shift, and the shift sequences of some m-arrays. We use these shift sequences to produce arrays for watermarking of digital images. Matrices can also be unfolded into long sequences by diagonal unfolding (with no deterioration in correlation) or row-by-row unfolding, with some degradation in correlation.
dc.identifierhttps://arxiv.org/abs/cs/0508022
dc.identifierhttp://arxiv.org/abs/cs/0508022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133482
dc.subjectDiscrete Mathematics
dc.subjectCryptography and Security
dc.subjectInformation Theory
dc.titleMatrix Construction Using Cyclic Shifts of a Column
dc.typetext

Files

Collections

arXiv