# American Institute of Mathematical Sciences

November  2008, 2(4): 403-420. doi: 10.3934/amc.2008.2.403

## Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity

 1 Institut TELECOM, TELECOM ParisTech, 46, rue Barrault, 75634 Paris Cedex 13, France 2 Institut TELECOM - TELECOM ParisTech, & Centre National de la Recherche Scientifique - LTCI UMR 5141, 46, rue Barrault, 75634 Paris Cedex 13, France, France, France, France

Received  May 2008 Revised  October 2008 Published  November 2008

Consider an undirected bipartite graph $G=(V=I\cup A,E)$, with no edge inside $I$ nor $A$. For any vertex $v\in V$, let $N(v)$ be the set of neighbours of $v$. A code $C \subseteq A$ is said to be discriminating if all the sets $N(i) \cap C$, $i \in I$, are nonempty and distinct. We study some properties of discriminating codes. In particular, we give bounds on the minimum size of these codes, investigate graphs where minimal discriminating codes have size close to the upper bound, or give the exact minimum size in particular graphs; we also give an NP-completeness result.
Citation: Emmanuel Charbit, Irène Charon, Gérard Cohen, Olivier Hudry, Antoine Lobstein. Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Advances in Mathematics of Communications, 2008, 2 (4) : 403-420. doi: 10.3934/amc.2008.2.403
 [1] Mikko Pelto. On $(r,\leq 2)$-locating-dominating codes in the infinite king grid. Advances in Mathematics of Communications, 2012, 6 (1) : 27-38. doi: 10.3934/amc.2012.6.27 [2] Cristóbal Camarero, Carmen Martínez, Ramón Beivide. Identifying codes of degree 4 Cayley graphs over Abelian groups. Advances in Mathematics of Communications, 2015, 9 (2) : 129-148. doi: 10.3934/amc.2015.9.129 [3] Srimathy Srinivasan, Andrew Thangaraj. Codes on planar Tanner graphs. Advances in Mathematics of Communications, 2012, 6 (2) : 131-163. doi: 10.3934/amc.2012.6.131 [4] Florent Foucaud, Tero Laihonen, Aline Parreau. An improved lower bound for $(1,\leq 2)$-identifying codes in the king grid. Advances in Mathematics of Communications, 2014, 8 (1) : 35-52. doi: 10.3934/amc.2014.8.35 [5] Ettore Fornasini, Telma Pinho, Raquel Pinto, Paula Rocha. Composition codes. Advances in Mathematics of Communications, 2016, 10 (1) : 163-177. doi: 10.3934/amc.2016.10.163 [6] Alexis Eduardo Almendras Valdebenito, Andrea Luigi Tironi. On the dual codes of skew constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (4) : 659-679. doi: 10.3934/amc.2018039 [7] Michael Braun. On lattices, binary codes, and network codes. Advances in Mathematics of Communications, 2011, 5 (2) : 225-232. doi: 10.3934/amc.2011.5.225 [8] Dina Ghinelli, Jennifer D. Key. Codes from incidence matrices and line graphs of Paley graphs. Advances in Mathematics of Communications, 2011, 5 (1) : 93-108. doi: 10.3934/amc.2011.5.93 [9] Padmapani Seneviratne, Martianus Frederic Ezerman. New quantum codes from metacirculant graphs via self-dual additive $\mathbb{F}_4$-codes. Advances in Mathematics of Communications, 2022  doi: 10.3934/amc.2021073 [10] Ricardo A. Podestá, Denis E. Videla. The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021002 [11] Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal. Zig-zag and replacement product graphs and LDPC codes. Advances in Mathematics of Communications, 2008, 2 (4) : 347-372. doi: 10.3934/amc.2008.2.347 [12] Joaquim Borges, Josep Rifà, Victor A. Zinoviev. Families of nested completely regular codes and distance-regular graphs. Advances in Mathematics of Communications, 2015, 9 (2) : 233-246. doi: 10.3934/amc.2015.9.233 [13] Washiela Fish, Jennifer D. Key, Eric Mwambene. Binary codes from reflexive uniform subset graphs on $3$-sets. Advances in Mathematics of Communications, 2015, 9 (2) : 211-232. doi: 10.3934/amc.2015.9.211 [14] Hans-Joachim Kroll, Sayed-Ghahreman Taherian, Rita Vincenti. Optimal antiblocking systems of information sets for the binary codes related to triangular graphs. Advances in Mathematics of Communications, 2022, 16 (1) : 169-183. doi: 10.3934/amc.2020107 [15] Joaquim Borges, Josep Rifà, Victor Zinoviev. Completely regular codes by concatenating Hamming codes. Advances in Mathematics of Communications, 2018, 12 (2) : 337-349. doi: 10.3934/amc.2018021 [16] Can Xiang, Jinquan Luo. Some subfield codes from MDS codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021023 [17] Ram Krishna Verma, Om Prakash, Ashutosh Singh, Habibul Islam. New quantum codes from skew constacyclic codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021028 [18] Ranya Djihad Boulanouar, Aicha Batoul, Delphine Boucher. An overview on skew constacyclic codes and their subclass of LCD codes. Advances in Mathematics of Communications, 2021, 15 (4) : 611-632. doi: 10.3934/amc.2020085 [19] M. B. Paterson, D. R. Stinson, R. Wei. Combinatorial batch codes. Advances in Mathematics of Communications, 2009, 3 (1) : 13-27. doi: 10.3934/amc.2009.3.13 [20] Noam Presman, Simon Litsyn. Recursive descriptions of polar codes. Advances in Mathematics of Communications, 2017, 11 (1) : 1-65. doi: 10.3934/amc.2017001

2020 Impact Factor: 0.935