Disjoint identifying-codes for arbitrary graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 244-248

  Laifenfeld, Moshe ^a   Trachtenberg, Ari ^a  

^a Boston University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IDENTIFYING CODES; SENSOR INTERFERENCE; SENSOR TRANSMISSIONS; WIRELESS LOCATION;

GRAPH THEORY; RADIO INTERFERENCE; RELIABILITY THEORY; ROBUSTNESS (CONTROL SYSTEMS); SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

CODES (SYMBOLS);

EID: 33749424800     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523331     Document Type: Conference Paper

References (13)

1. M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, "A new class of codes for identification of vertices in graphs," IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 599-611, March 1998.
2. R. Ungrangsi, "Location detection in emergency sensor networks using robust identifying codes," Master's thesis, Boston University, 2003.
3. S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, "Robust location detection with sensor networks," IEEE Journal on Selected Areas in Communications (Special Issue on Fundamental Performance Limits of Wireless Sensor Networks), vol. 22, no. 6, August 2004.
4. S. Ray, R. Ungrangsi, F. D. Pellegrinin, A. Trachtenberg, and D. Starobinski, "Robust location detection in emergency sensor networks," Proc. INFOCOM, April 2003.
5. K. Chakrabarty, H. Qi, S. S. Iyengar, and E. Cho, "Coding theory framework for target location in distributed sensor networks," in International Symposium on Information Technology: Coding and Computing, 2001, pp. 130-134.
6. R. Ungrangsi, A. Trachtenberg, and D. Starobinski, "An implementation of indoor location detection systems based on identifying codes," Proc. of the IFIP International Conference on Intelligence in Communication Systems (INTELLCOMM 04), 2004.
7. I. Honkala and A. Lobstein, "On identifying codes in binary hamming spaces," Journal of Comb. Theory, Series A, vol. 99, no. 2, pp. 232-243, 2002.
8. U. Feige, M. M. Halldorsson, G. Kortsarz, and A. Srinivasan, "Approximating the domatic number," SIAM J. Comput., vol. 32, no. 1, January 2003.
9. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
10. P. J. Slater, "Fault tolerant locating-dominating sets," Discrete Mathematics, vol. 249, no. 1-3, pp. 179-189, 2002.
11. I. Honkala, T. Laihonen, and S. Ranto, "On location-dominating codes in binary hamming spaces," Discrete Mathematics and Theoretical Computer Science, vol. 6, no. 2, pp. 265-282, June 2004. [Online]. Available: http://www.dmtcs.org/volumes/abstracts/dm060207.abs.html
12. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland Publishing Company, 1977.
13. N. Alon and J. Spencer, "The probabilistic method," 1992.