Results 1 to 10 of about 25,450 (191)

A unified approach to combinatorial key predistribution schemes for sensor networks [PDF]

, 2012
There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes.
C. Blundo, D. Liu, D.-Y. Pei, D.-Y. Pei, D.R. Stinson, Douglas R. Stinson, H. Hanani, J. Lee, J.-W. Dong, J.H. Lint van, J.L. Blanchard, L. Xu, Maura B. Paterson, P. Sarkar, P. Sarkar, S. Ruj, S. Çamtepe, S.R. Blackburn, W. Du, W.C. Huffman   +19 more
core   +3 more sources

Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices [PDF]

, 2015
Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing ...
Alsina, Daniel, Goyeneche, Dardo, Latorre, José I., Riera, Arnau, Życzkowski, Karol   +4 more
core   +2 more sources

Exotic complex Hadamard matrices, and their equivalence [PDF]

, 2010
In this paper we use a design theoretical approach to construct new, previously unknown complex Hadamard matrices. Our methods generalize and extend the earlier results of de la Harpe--Jones and Munemasa--Watatani and offer a theoretical explanation for ...
A Munemasa, A Winterhof, AT Butson, C Koukouvinos, Ferenc Szöllősi, G Björck, P Diţă, P Harpe de la, P Wocjan, R Craigen, RF Werner, S Popa, T Tao, U Haagerup, W Launey de, W Tadej   +15 more
core   +1 more source

R.A.Fisher, design theory, and the Indian connection [PDF]

, 2009
Design Theory, a branch of mathematics, was born out of the experimental statistics research of the population geneticist R. A. Fisher and of Indian mathematical statisticians in the 1930s.
A R P Rau, A. Ekert, A. R. P. Rau, Box Joan Fisher, C. H. Bennett, D. Jungnickel, D. R. Hughes, D. Rao Raghava, E. Witt, F. Yates, G. M. Dixon, H. Gropp, H. Gropp, H. Lenz, H. S. M. Coxeter, J. C. Baez, J. Gani, J. H. Bennett, J. Hadamard, J. Steiner, J. W. P. Hirschfeld, J. W. Tankard Jr, L. E. Dickson, M. Hall Jr, M. Pinl, M. Planat, M. Reiss, N. L. Biggs, N. L. Biggs, P. Levay, R C Bose, R. A. Fisher, R. A. Fisher, R. A. Fisher, R. A. Fisher, R. A. Fisher, R. C. Bose, R. C. Bose, S. E. Fienberg, S. R. Savur, T. Beth, T. L. Hankins, T. P. Kirkman, T. P. Kirkman   +43 more
core   +3 more sources

An asymptotic existence result on compressed sensing matrices [PDF]

, 2015
For any rational number $h$ and all sufficiently large $n$ we give a deterministic construction for an $n\times \lfloor hn\rfloor$ compressed sensing matrix with $(\ell_1,t)$-recoverability where $t=O(\sqrt{n})$. Our method uses pairwise balanced designs
Bryant, Darryn, Catháin, Padraig Ó
core   +2 more sources

Key Pre-Distributions From Graph-Based Block Designs

, 2015
With the development of wireless communication technologies which considerably contributed to the development of wireless sensor networks (WSN), we have witnessed an ever-increasing WSN based applications which induced a host of research activities in ...
Bouabdallah, Abdelmadjid, Ding, Jie, Tarokh, Vahid   +2 more
core   +3 more sources

Constructing Optimal Authentication Codes with Perfect Multi-fold Secrecy

, 2009
We establish a construction of optimal authentication codes achieving perfect multi-fold secrecy by means of combinatorial designs. This continues the author's work (ISIT 2009) and answers an open question posed therein. As an application, we present the
Huber, Michael
core   +1 more source

Learning-based ship design optimization approach [PDF]

, 2012
With the development of computer applications in ship design, optimization, as a powerful approach, has been widely used in the design and analysis process.
Cui, Hao, Sayer, Philip, Turan, Osman
core   +1 more source

Almost Hadamard matrices: general theory and examples

, 2012
We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\in M_N(\mathbb R)$ having the property that $U=H/\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N).
Banica, Teodor, Nechita, Ion, Zyczkowski, Karol   +2 more
core   +3 more sources

Generalized covering designs and clique coverings

, 2011
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both ...
Bailey, Robert F., Burgess, Andrea C., Cavers, Michael S., Meagher, Karen   +3 more
core   +2 more sources