scispace - formally typeset
Open AccessBook

Combinatorial Designs: Constructions and Analysis

TLDR
It is shown here how orthogonal Latin squares can be transformed into BIBDs using Hadamard matrices, and how different sets and automorphisms can be modified for different levels of integration.
Abstract
Introduction to BIBDs.- Symmetric BIBDs.- Difference sets and automorphisms.- Hadamard matrices and designs.- Resolvable BIBDs.- Steiner triple systems.- Mutually orthogonal Latin squares.- Pairwise balanced designs.- t-designs.- Orthogonal arrays and codes.- Index.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Energy conservation in wireless sensor networks: A survey

TL;DR: This paper breaks down the energy consumption for the components of a typical sensor node, and discusses the main directions to energy conservation in WSNs, and presents a systematic and comprehensive taxonomy of the energy conservation schemes.

Geometry of Quantum States

TL;DR: In this article, the space of isospectral 0Hermitian matrices is shown to be the space in which the number 6) and 7) occur twice in the figure, and the discussion between eqs.(5.14) and (5.15) is incorrect.
Journal ArticleDOI

Achieving the Welch bound with difference sets

TL;DR: This work constructs analytically optimal codebooks meeting the Welch lower bound, and develops an efficient numerical search method based on a generalized Lloyd algorithm that leads to considerable improvement on the achieved I/sub max/ over existing alternatives.
Journal ArticleDOI

Combinatorial design of key distribution mechanisms for wireless sensor networks

TL;DR: Novel deterministic and hybrid approaches based on Combinatorial Design are presented for deciding how many and which keys to assign to each key-chain before the sensor network deployment to obtain efficient key distribution schemes.
References
More filters
Journal ArticleDOI

How to share a secret

TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Book

The Theory of Error-Correcting Codes

TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Proceedings ArticleDOI

Safeguarding cryptographic keys

TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.