✦ LIBER ✦

Two families of optimal identifying codes in binary Hamming spaces

✍ Scribed by Ranto, S.M.; Honkala, I.S.; Laihonen, T.K.

Book ID: 114542194
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 269 KB
Volume: 48
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.995650

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Identifying Codes in Binary Hamming S

On Identifying Codes in Binary Hamming Spaces

✍ Iiro Honkala; Antoine Lobstein 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 138 KB

A binary code C f0; 1g n is called r-identifying, if the sets B r ðxÞ \ C; where B r ðxÞ is the set of all vectors within the Hamming distance r from x; are all nonempty and no two are the same. Denote by M r ðnÞ the minimum possible cardinality of a binary r-identifying code in f0; 1g n : We prove

On Codes Identifying Sets of Vertices in

On Codes Identifying Sets of Vertices in Hamming Spaces

✍ Iiro Honkala; Tero Laihonen; Sanna Ranto 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 98 KB

A family of optimal identifying codes in

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