Title :
Improved Identifying Codes in F2n
Author :
Exoo, G. ; Laihonen, T. ; Ranto, S.
Author_Institution :
Dept. of Math. & Comput. Sci., Indiana State Univ., Terre Haute, IN
Abstract :
In binary Hamming spaces, we construct new 1- identifying codes which improve on previously known upper bounds on the cardinalities of 1-identifying codes for many lengths when n ges 10. We also construct tau-identifying codes using the direct sum of tau codes that are 1-identifying.
Keywords :
Hamming codes; binary codes; binary Hamming space; binary field; direct sum of tau codes; identifying code; Computer science; Energy conservation; Fault diagnosis; Hamming distance; Hypercubes; Mathematics; Multiprocessing systems; Testing; Upper bound;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557358
