✦ LIBER ✦

On optimal superimposed codes

✍ Scribed by Hyun Kwang Kim; Vladimir Lebedev

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 133 KB
Volume: 12
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.10056

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A binary (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as a concept of key distribution patterns. In this paper, we develop a method of constructing superimposed codes and prove that some superimposed codes constructed in this way are optimal. © 2003 Wiley Periodicals, Inc. J Combin Designs 12: 79–71, 2004.

📜 SIMILAR VOLUMES

Some new results on superimposed codes

✍ Hyun Kwang Kim; Vladimir Lebedev; Dong Yeol Oh 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract A (__w__,__r__) __cover‐free family__ is a family of subsets of a finite set such that no intersection of __w__ members of the family is covered by a union of __r__ others. A (__w__,__r__) __superimposed code__ is the incidence matrix of such a family. Such a family also arises in crypt

Window optimization in isotachophoresis

Window optimization in isotachophoresis superimposed on capillary zone electrophoresis

✍ Jozef L. Beckers 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

## Window optimization in isotachophoresis superimposed on capillary zone electrophoresis A sample stacking procedure to which a specific combination of electrolyte solutions is applied is isotachophoresis (ITP) superimposed on capillary zone electrophoresis (CZE), a so-called ITP/CZE system. In I

Optimal doubly constant weight codes

✍ Tuvi Etzion 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

A doubly constant weight code is a binary code of length n 1 + n 2 , with constant weight w 1 + w 2 , such that the weight of a codeword in the first n 1 coordinates is w 1 . Such codes have applications in obtaining bounds on the sizes of constant weight codes with given minimum distance. Lower and

Optimal Codes for Strong Identification

✍ Tero Laihonen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, ≤ l)-identifying codes in Hamming spaces for every l when l ≥ 3.

Optimal random coding

✍ Charles S. Peskin 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

Optimal (4up, 5, 1) optical orthogonal c

Optimal (4up, 5, 1) optical orthogonal codes

✍ Yanxun Chang; L. Ji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract By a (__ν__, __k__, 1)‐OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4__p__, 5, 1)‐OOC exists for prime __p__ ≡ 1 (mod 10), and that an optimal (4__up__, 5, 1)‐OOC exists for __u__ = 2, 3 and prime __p__ ≡ 11 (mod 20). These results are obtained by