✦ LIBER ✦

Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions

✍ Scribed by Fertonani, D.; Duman, T.M.; Erden, M.F.

Book ID: 114612044
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 178 KB
Volume: 59
Category: Article
ISSN: 0090-6778
DOI: 10.1109/tcomm.2010.110310.090039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reliable communication over channels wit

Reliable communication over channels with insertions, deletions, and substitutions

✍ Davey, M.C.; Mackay, D.J.C. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 299 KB

Pattern recognition of strings with subs

Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions

✍ B.J. Oommen; R.K.S. Loke 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 939 KB

We study the problem of recognizing a string Y which is the noisy version of some unknown string X\* chosen from a finite dictionary, H. The traditional case which has been extensively studied in the literature is the one in which Y contains substitution, insertion and deletion (SID) errors. Althoug

Novel Bounds on the Capacity of the Bina

Novel Bounds on the Capacity of the Binary Deletion Channel

✍ Fertonani, D.; Duman, T.M. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 755 KB

Bounds on the capacity of the unidirecti

Bounds on the capacity of the unidirectional channels

✍ Tallini, L.G. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 98 KB

Upper bounds on the capacity of Gaussian

Upper bounds on the capacity of Gaussian channels with feedback

✍ Ozarow, L.H. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 417 KB

A Simple Lower Bound for the Capacity of

A Simple Lower Bound for the Capacity of the Deletion Channel

✍ Mitzenmacher, M.; Drinea, E. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 171 KB