✦ LIBER ✦

A Generalization of Omura's Decoding Algorithm and a Proof of Convergence

✍ Scribed by Axvig, Nathan

Book ID: 121834494
Publisher: IEEE
Year: 2014
Tongue: English
Weight: 956 KB
Volume: 60
Category: Article
ISSN: 0018-9448
DOI: 10.1109/TIT.2014.2313696

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dykstras algorithm with bregman projecti

Dykstras algorithm with bregman projections: A convergence proof

✍ Bauschke, Heinz H; Lewis, Adrian S 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 709 KB

A generalization of Dijkstra's algorithm

✍ Donald E. Knuth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 600 KB

A generalization of Gosper's algorithm

✍ Marko Petkovšek 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A Proof of Hardy's Convergence Theorem

✍ Broadbent, T. A. A. 📂 Article 📅 1928 🏛 Oxford University Press 🌐 English ⚖ 63 KB

A short proof for a generalization of Vi

A short proof for a generalization of Vizing's theorem

✍ Claude Berge; Jean Claude Fournier 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re

A Short Proof of a Generalization on Opi

A Short Proof of a Generalization on Opial′s Inequality

✍ X.G. He 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 42 KB