✦ LIBER ✦

Information compression and Varshamov-Gilbert bound

✍ Scribed by R.E. Krichevsky

Book ID: 113383819
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 649 KB
Volume: 74
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90008-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strengthening the Gilbert–Varshamov boun

Strengthening the Gilbert–Varshamov bound

✍ Alexander Barg; Sugi Guritman; Juriaan Simonis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 86 KB

The paper discusses some ways to strengthen (nonasymptotically) the Gilbert-Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its

Lengthening and the Gilbert-Varshamov bo

Lengthening and the Gilbert-Varshamov bound

✍ Edel, Y.; Bierbrauer, J. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 67 KB

Improved Gilbert-Varshamov bound for con

Improved Gilbert-Varshamov bound for constrained systems

✍ Marcus, B.H.; Roth, R.M. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 819 KB

Goppa geometric codes achieving the Gilb

Goppa geometric codes achieving the Gilbert-Varshamov bound

✍ Chaoping Xing 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 191 KB

Improving the Gilbert-Varshamov bound fo

Improving the Gilbert-Varshamov bound for q-ary codes

✍ Vu, V.; Wu, L. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 232 KB

Some results related to generalized Vars

✍ Deza, M.; Hoffman, F. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 306 KB