Search results for "Identifying Codes"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, David Starobinski	Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes.	MONET	2009	DBLP DOI BibTeX RDF	robust identifying codes, sensor networks, routing, distributed algorithms
3	Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein	Links Between Discriminating and Identifying Codes in the Binary Hamming Space.	AAECC	2007	DBLP DOI BibTeX RDF	Discriminating Codes, Identifying Codes, Hamming Space, Graph Theory, Hypercub, Coding Theory
2	Moshe Laifenfeld, Ari Trachtenberg	Identifying Codes and Covering Problems.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto	Improved Upper Bounds on Binary Identifying Codes.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, David Starobinski	Joint monitoring and routing in wireless sensor networks using robust identifying codes.	BROADNETS	2007	DBLP DOI BibTeX RDF
2	Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin	On robust and dynamic identifying codes.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
2	Ying Xiao, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman	The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm.	COCOON	2006	DBLP DOI BibTeX RDF
2	Rachanee Ungrangsi, Ari Trachtenberg, David Starobinski	An Implementation of Indoor Location Detection Systems Based on Identifying Codes.	INTELLCOMM	2004	DBLP DOI BibTeX RDF
2	Krishnendu Chakrabarty, S. Sitharama Iyengar, Hairong Qi, Eungchun Cho	Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	Covering codes, identifying codes, sensor density, sensor field, optimization, integer linear programming
2	Uri Blass, Iiro S. Honkala, Simon Litsyn	On tHe Size of Identifying Codes.	AAECC	1999	DBLP DOI BibTeX RDF
1	Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud	On the size of identifying codes in triangle-free graphs.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov	Edge identifying codes.	Electronic Notes in Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau	On two variations of identifying codes.	Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Gabriela Araujo-Pardo, Camino Balbuena, Luis Pedro Montejano, Juan Carlos Valenzuela	Partial linear spaces and identifying codes.	Eur. J. Comb.	2011	DBLP DOI BibTeX RDF
1	Alexander Barg, Grigory Kabatiansky	Robust parent-identifying codes and combinatorial arrays.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Florent Foucaud, Guillem Perarnau	Bounds for identifying codes in terms of degree parameters	CoRR	2011	DBLP BibTeX RDF
1	Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov	Identifying codes in line graphs	CoRR	2011	DBLP BibTeX RDF
1	Florent Foucaud, Tero Laihonen, Aline Parreau	An improved lower bound for (1,<=2)-identifying codes in the king grid	CoRR	2011	DBLP BibTeX RDF
1	Brendon Stanton	Improved Bounds for r-Identifying Codes of the Hex Grid.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Chunxia Chen, Changhong Lu, Zhengke Miao	Identifying codes and locating-dominating sets on paths and cycles.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Sanna M. Ranto	On binary linear r-identifying codes.	Des. Codes Cryptography	2011	DBLP DOI BibTeX RDF
1	Niloofar Fazlollahi, David Starobinski, Ari Trachtenberg	Connected identifying codes for sensor network monitoring.	WCNC	2011	DBLP DOI BibTeX RDF
1	Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto	Improved bounds on identifying codes in binary Hamming spaces.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein	New identifying codes in the binary Hamming space.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	David Auger	Minimal identifying codes in trees and planar graphs with large girth.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	Ryan Martin, Brendon Stanton	Lower Bounds for Identifying Codes in some Infinite Grids.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Mikko Pelto	New bounds for (r, <= 2)-identifying codes in the infinite king grid.	Cryptography and Communications	2010	DBLP DOI BibTeX RDF
1	Daniel W. Cranston, Gexin Yu	A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid	CoRR	2010	DBLP BibTeX RDF
1	Olivier Delmas, Sylvain Gravier, Mickaël Montassier, Aline Parreau	On two variations of identifying codes	CoRR	2010	DBLP BibTeX RDF
1	David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein	Watching Systems in graphs: an extension of Identifying Codes	CoRR	2010	DBLP BibTeX RDF
1	Florent Foucaud, Reza Naserasr, Aline Parreau	Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets	CoRR	2010	DBLP BibTeX RDF
1	Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud	On the size of identifying codes in triangle-free graphs	CoRR	2010	DBLP BibTeX RDF
1	Svante Janson, Tero Laihonen	On the size of identifying codes in binary hypercubes.	J. Comb. Theory, Ser. A	2009	DBLP DOI BibTeX RDF
1	David Auger	Identifying Codes in Trees and Planar Graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Daniel W. Cranston, Gexin Yu	A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid.	Electr. J. Comb.	2009	DBLP BibTeX RDF
1	Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar	The Budgeted Unique Coverage Problem and Color-Coding.	CSR	2009	DBLP DOI BibTeX RDF
1	Michael J. Collins	Upper bounds for parent-identifying set systems.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 94A60
1	David L. Roberts, Fred S. Roberts	Locating sensors in paths and cycles: The case of 2-identifying codes.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	Tero Laihonen	On cages admitting identifying codes.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu	Identifying codes of cycles with odd orders.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On Identifying Codes in the King Grid that are Robust Against Edge Deletions.	Electr. J. Comb.	2008	DBLP BibTeX RDF
1	Sylvain Gravier, Julien Moncel, Ahmed Semri	Identifying Codes of Cartesian Product of Two Cliques of the Same Size.	Electr. J. Comb.	2008	DBLP BibTeX RDF
1	Sylvain Gravier, Ralf Klasing, Julien Moncel	Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.	Algorithmic Operations Research	2008	DBLP BibTeX RDF
1	Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto	New bounds on binary identifying codes.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto	Improved bounds on binary identifying codes.	ISIT	2008	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On a new class of identifying codes in graphs.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Jukka Suomela	Approximability of identifying codes and locating-dominating codes.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On identifying codes that are robust against edge changes.	Inf. Comput.	2007	DBLP DOI BibTeX RDF
1	Charon Cohen, Hudry Lobstein	Discriminating and Identifying Codes in the Binary Hamming Space	CoRR	2007	DBLP BibTeX RDF
1	Gareth Howells, Evangelos Papoutsis, Andrew B. T. Hopkins, Klaus D. McDonald-Maier	Normalizing Discrete Circuit Features with Statistically Independent values for incorporation within a highly Secure Encryption System.	AHS	2007	DBLP DOI BibTeX RDF
1	Iiro S. Honkala	A family of optimal identifying codes in Z2.	J. Comb. Theory, Ser. A	2006	DBLP DOI BibTeX RDF
1	Sylvain Gravier, Julien Moncel, Ahmed Semri	Identifying codes of cycles.	Eur. J. Comb.	2006	DBLP DOI BibTeX RDF
1	Tero Laihonen	Optimal t-Edge-Robust r-Identifying Codes in the King Lattice.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF
1	Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel	A linear algorithm for minimum 1-identifying codes in oriented trees.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	Tero Laihonen	On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes.	SIAM J. Discrete Math.	2005	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On identifying codes in the hexagonal mesh.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
1	Marc Daniel, Sylvain Gravier, Julien Moncel	Identifying codes in some subgraphs of the square lattice.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Noga Alon, Uri Stav	New Bounds on Parent-Identifying Codes: The Case of Multiple Parents.	Combinatorics, Probability & Computing	2004	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On identifying codes in the triangular and square grids.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Saikat Ray, David Starobinski, Ari Trachtenberg, Rachanee Ungrangsi	Robust location detection with sensor networks.	IEEE Journal on Selected Areas in Communications	2004	DBLP DOI BibTeX RDF
1	Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn	Generalized hashing and parent-identifying codes.	J. Comb. Theory, Ser. A	2003	DBLP DOI BibTeX RDF
1	Sanna M. Ranto	Optimal linear identifying codes.	IEEE Transactions on Information Theory	2003	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen	On the Identification of Sets of Points in the Square Lattice.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Antoine Lobstein	On Identifying Codes in Binary Hamming Spaces.	J. Comb. Theory, Ser. A	2002	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Antoine Lobstein	On the Density of Identifying Codes in the Square Lattice.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
1	Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto	On strongly identifying codes.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Irène Charon, Olivier Hudry, Antoine Lobstein	Identifying Codes with Small Radius in Some Infinite Regular Graphs.	Electr. J. Comb.	2002	DBLP BibTeX RDF
1	Tero Laihonen	Sequences of optimal identifying codes.	IEEE Transactions on Information Theory	2002	DBLP DOI BibTeX RDF
1	Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen	Two families of optimal identifying codes in binary Hamming spaces.	IEEE Transactions on Information Theory	2002	DBLP DOI BibTeX RDF
1	Noga Alon, Eldar Fischer, Mario Szegedy	Parent-Identifying Codes.	J. Comb. Theory, Ser. A	2001	DBLP DOI BibTeX RDF
1	Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn	Intersecting codes and partially identifying codes.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Uri Blass, Iiro S. Honkala, Simon Litsyn	Bounds on identifying codes.	Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein	General Bounds for Identifying Codes in Some Infinite Regular Graphs.	Electr. J. Comb.	2001	DBLP BibTeX RDF
1	Sylvia B. Encheva, Gérard D. Cohen	Partially Identifying Codes for Copyright Protection.	AAECC	2001	DBLP DOI BibTeX RDF	Secure frameproof codes, designs, copyright protection
1	Krishnendu Chakrabarty, S. Sitharama Iyengar, Hairong Qi, Eungchun Cho	Coding Theory Framework for Target Location in Distributed Sensor Networks.	ITCC	2001	DBLP DOI BibTeX RDF
1	Tero Laihonen, Sanna M. Ranto	Codes Identifying Sets of Vertices.	AAECC	2001	DBLP DOI BibTeX RDF