✦ LIBER ✦

Upper bounds on separating codes

✍ Scribed by Cohen, G.D.; Schaathun, H.G.

Book ID: 114638329
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 212 KB
Volume: 50
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2004.828140

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved upper bounds on sizes of codes

✍ Mounits, B.; Etzion, T.; Litsyn, S. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 341 KB

Improved Upper Bounds on Binary Identify

Improved Upper Bounds on Binary Identifying Codes

✍ Exoo, G.; Laihonen, T.; Ranto, S. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 368 KB

Upper bounds on the size of quantum code

Upper bounds on the size of quantum codes

✍ Ashikhmin, A.; Litsyu, S. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 241 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≤ 8 are tabulated. It turns out

Upper bounds on the rate of LDPC codes

✍ Burshtein, D.; Krivelevich, M.; Litsyn, S.; Miller, G. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 455 KB