40 citations · 53 across the 12 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010★ 40 cited
Extremal graphs for the identifying code problem
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse +3
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at mo…
cs.DM2009
Computing the distance distribution of systematic non-linear codes
Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala
The most important families of non-linear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the…