✦ LIBER ✦

Optimal linear identifying codes

✍ Scribed by Ranto, S.M.

Book ID: 114637123
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 317 KB
Volume: 49
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2003.810657

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequences of optimal identifying codes

✍ Laihonen, T.K. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 121 KB

Optimal ternary linear codes

✍ R. Hill; D. E. Newton 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 932 KB

Let nq (k, d) denote the smallest value ofn for which there exists a linear In, k, d]-code over GF(q). An In, k, d]-code whose length is equal to nq(k, d) is called optimal. The problem of finding nq(k, d) has received much attention for the case q = 2. We generalize several results to the case of a

Optimal Identifying Codes in Cycles and

Optimal Identifying Codes in Cycles and Paths

✍ Ville Junnila, Tero Laihonen 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 200 KB

A family of optimal identifying codes in

✍ Iiro Honkala 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 90 KB

New optimal ternary linear codes

✍ Gulliver, T.A. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 392 KB

Five new optimal ternary linear codes

✍ Van Eupen, M. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 100 KB