✦ LIBER ✦

The effect of redundancy on probability bounds

✍ Scribed by Fred M. Hoppe

Book ID: 108113985
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 338 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Lower Bounds for the Redundancy of Op

On Lower Bounds for the Redundancy of Optimal Codes

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 108 KB

A class of lower bounds on the Bayesian

A class of lower bounds on the Bayesian probability of error

✍ D.E. Boekee; J.C. Ruitenbeek 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 627 KB

On Upper Bounds for the Decoding Error P

On Upper Bounds for the Decoding Error Probability of Convolutional Codes

✍ M. V. Burnashev 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 218 KB

Combinatorial probability and the tightn

Combinatorial probability and the tightness of generalization bounds

✍ K. V. Vorontsov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 365 KB

A lower bound on the probability of a un

A lower bound on the probability of a union

✍ D. de Caen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Redundancy effect on yield of binary tre

Redundancy effect on yield of binary tree RAMs

✍ B. Ciciani 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 960 KB

Recently, a radically new RAM architecture was proposed by Jarwala and Pradhan [10] called TRAM architecture. A 64M version of this architecture is being prototyped by a DRAM manufacturer in Japan. The yield sensitivity of this binary Tree Dynamic RAMs (TRAMs) at variations in tree-depth and redunda