✦ LIBER ✦

A New Lower Bound on the Minimal Length of a Binary Linear Code

✍ Scribed by M.C. Bhandari; M.S. Garg

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 256 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

Gallager bounds on the performance of ma

Gallager bounds on the performance of maximum-likelihood decoded linear binary block codes in AWGN interference

✍ Yousefi, Shahram 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

Lower-bounds on the connectivities of a

Lower-bounds on the connectivities of a graph

✍ Abdol H. Esfahanian 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 1 views

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A Lower Bound for the One-Chromatic Numb

A Lower Bound for the One-Chromatic Number of a Surface

✍ V.P. Korzhik 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A lower bound on the independence number

A lower bound on the independence number of arbitrary hypergraphs

✍ Thiele, Torsten 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 3 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies α(H) ≥ v∈V f (d