scispace - formally typeset
MonographDOI

Hadamard matrices and their applications

TLDR
This original work is based on the development of an algebraic link between Hadamard matrices and the cohomology of finite groups that was discovered fifteen years ago, and identifies cocyclic generalized Hadamards with particular "stars" in four other areas of mathematics and engineering: group cohomological structures, incidence structures, combinatorics, and signal correlation.
Abstract
In Hadamard Matrices and Their Applications, K. J. Horadam provides the first unified account of cocyclic Hadamard matrices and their applications in signal and data processing. This original work is based on the development of an algebraic link between Hadamard matrices and the cohomology of finite groups that was discovered fifteen years ago. The book translates physical applications into terms a pure mathematician will appreciate, and theoretical structures into ones an applied mathematician, computer scientist, or communications engineer can adapt and use. The first half of the book explains the state of our knowledge of Hadamard matrices and two important generalizations: matrices with group entries and multidimensional Hadamard arrays. It focuses on their applications in engineering and computer science, as signal transforms, spreading sequences, error-correcting codes, and cryptographic primitives. The book's second half presents the new results in cocyclic Hadamard matrices and their applications. Full expression of this theory has been realized only recently, in the Five-fold Constellation. This identifies cocyclic generalized Hadamard matrices with particular "stars" in four other areas of mathematics and engineering: group cohomology, incidence structures, combinatorics, and signal correlation. Pointing the way to possible new developments in a field ripe for further research, this book formulates and discusses ninety open questions.

read more

Citations
More filters
Journal ArticleDOI

On mutually unbiased bases

TL;DR: In this paper, the authors present a unified approach in which the basis states are labeled by numbers 0, 1, 2, …, N - 1 that are both elements of a Galois field and ordinary integers, and show how to use the thus constructed mutually unbiased bases in quantum-informatics applications, including dense coding, teleportation, entanglement swapping, covariant cloning, and state tomography.
Book ChapterDOI

Vectorial Boolean Functions for Cryptography

Claude Carlet
TL;DR: To appear as a chapter of the volume " Boolean Methods and Models " , this chapter describes the construction of Boolean models and some examples show how to model Boolean functions using LaSalle's inequality.
Posted Content

Distributed Mean Estimation with Limited Communication

TL;DR: This work shows that applying a structured random rotation before quantization and a better coding strategy further reduces the error to O(1/n) and shows that the latter coding strategy is optimal up to a constant in the minimax sense i.e., it achieves the best MSE for a given communication cost.
Journal ArticleDOI

Recovery of Sparsely Corrupted Signals

TL;DR: In this paper, the authors investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting sparse representations in another general dictionary.