Optimal linear identifying codes

IEEE Transactions on Information Theory

Volumn 49, Issue 6, 2003, Pages 1544-1547

  Ranto, Sanna M ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Code construction; Covering codes; Hamming space; Identifying codes; Linear codes

Indexed keywords

CODES (SYMBOLS); SET THEORY; THEOREM PROVING;

LINEAR CODES;

INFORMATION THEORY;

EID: 0038042066     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.810657     Document Type: Article

References (7)

1. M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, "On a new class of codes for identifying vertices in graphs," IEEE Trans. Inform. Theory, vol. 44, pp. 599-611, Mar. 1998.
2. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes. Amsterdam, The Netherlands: Elsevier, 1997.
3. U. Blass, I. Honkala, and S. Litsyn, "Bounds on identifying codes," Discr. Math., vol. 241, no. 1-3, pp. 119-128, 2001.
4. I. Honkala, T. Laihonen, and S. Ranto, "On codes identifying sets of vertices in Hamming spaces," Des., Codes, Cryptogr., vol. 24, pp. 193-204, 2001.
5. T. Laihonen, "Sequences of optimal identifying codes," IEEE Trans. Inform. Theory, vol. 48, pp. 774-776, Mar. 2002.
6. I. Honkala, T. Laihonen, and S. Ranto, "On strongly identifying codes," Discr. Math., vol. 254, pp. 191-205, 2002.
7. T. Laihonen, "Optimal codes for strong identification," Europ. J. Combin., vol. 23, no. 3, pp. 307-313, 2002.