A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We determine the minimum cardinality of an identifying code of $K_n\square K_n$, the Cartesian product of two cliques of same size. Moreover we show that this code is unique, up to row and column permutations, when $n\geq 5$ is odd. If $n\geq 4$ is even, we exhibit two distinct optimal identifying codes.doi:10.37236/879 fatcat:s37hoqlfynbpxcjy5qvfliq3yq