✦ LIBER ✦

On Codes Identifying Sets of Vertices in Hamming Spaces

✍ Scribed by Iiro Honkala; Tero Laihonen; Sanna Ranto

Book ID: 110299078
Publisher: Springer
Year: 2001
Tongue: English
Weight: 98 KB
Volume: 24
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1011256721935

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

Two families of optimal identifying code

Two families of optimal identifying codes in binary Hamming spaces

✍ Ranto, S.M.; Honkala, I.S.; Laihonen, T.K. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 269 KB

On a new class of codes for identifying

On a new class of codes for identifying vertices in graphs

✍ Karpovsky, M.G.; Chakrabarty, K.; Levitin, L.B. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 629 KB

Exact Minimum Density of Codes Identifyi

Exact Minimum Density of Codes Identifying Vertices in the Square Grid

✍ Ben-Haim, Yael; Litsyn, Simon 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

On reconstructive sets of vertices in th

On reconstructive sets of vertices in the Boolean cube

✍ Vasil’eva, A. Yu. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 496 KB

On the complexity of the identification

On the complexity of the identification problem in Hamming spaces

✍ Iiro Honkala; Antoine Lobstein 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 120 KB