✦ LIBER ✦

An algorithm for “Ulam's Game” and its application to error correcting codes

✍ Scribed by Eugene L. Lawler; Sergei Sarkissian

Book ID: 107766269
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 448 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00127-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Correction to 'An Erasures-and-Errors De

Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes'

✍ Sugiyama, Y.; Kasahara, M.; Hirasawa, S.; Namekawa, T. 📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 135 KB

An adaptive irregular sampling algorithm

An adaptive irregular sampling algorithm and its application to image coding

✍ G. Ramponi; S. Carrato 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An algorithm for detecting unreliable co

An algorithm for detecting unreliable code sequence segments and its applications

✍ Freudenberger, J.; Stender, B. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 235 KB

New decoding algorithm for a class of si

New decoding algorithm for a class of simple iterated codes–its application to decoding algorithm for reed-muller codes

✍ Kinichiroh Tokiwa; Nasao Kasahara; Toshihiko Namekawa 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

Implicit function theorem and its applic

Implicit function theorem and its application to a Ulam’s problem for exact differential equations

✍ Soon-Mo Jung 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 187 KB

Block error-correcting codes for systems

Block error-correcting codes for systems with a very high BER: Theoretical analysis and application to the protection of watermarks

✍ Claude Desset; Benoı̂t Macq; Luc Vandendorpe 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

This paper addresses the problem of error-correction for extremely noisy channels (BER from 0:1 to 0:5), such as those obtained for image or video watermarking. Minimum distance arguments are used to identify a region for which no other code is as efficient as repetition codes, whatever the rate, at