✦ LIBER ✦

Optimal random coding

✍ Scribed by Charles S. Peskin

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 163 KB
Volume: 39
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.3160390104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Optimal Random Nets

✍ Peter Mathé 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 320 KB

On optimal superimposed codes

✍ Hyun Kwang Kim; Vladimir Lebedev 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 133 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 __binary__ (__w,r__) __superimposed code__ is the incidence matrix of such a family. Such a family also arises in cr

Optimal PR-QMF Design for Subband Image

Optimal PR-QMF Design for Subband Image Coding

✍ H. Caglar; Y. Liu; A.N. Akansu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 464 KB

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.

Randomness-optimal oblivious sampling

✍ David Zuckerman 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any ␣ ) 0, it Ž .Ž y 1 . Ž y 1 y 1 . uses 1 q ␣ m q log ␥ random bits to output ds poly ⑀ , log ␥ , m sample points Ä 4 m Ä 4 m w x w<Ž .