Identifying codes of Cartesian product of two cliques of the same size.
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On identifying codes in the King grid that are robust against edge deletions.”
Identifying codes of Cartesian product of two cliques of the same size.
Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An optimal strongly identifying code in the infinite triangular grid.
Honkala, Iiro (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Algorithm and experiments in testing planar graphs for isomorphism.
Kukluk, Jacek P., Holder, Lawrence B., Cook, Diane J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Graphs associated with codes of covering radius 1 and minimum distance 2.
Hall, Joanne L. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ternary constant weight codes.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
New bounds for codes identifying vertices in graphs.
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Identifying codes with small radius in some infinite regular graphs.
Charon, Irène, Hudry, Olivier, Lobstein, Antoine (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Multiple Deletion Codes
Landjev, Ivan, Haralambiev, Kristiyan (2007)
Serdica Journal of Computing
Similarity:
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...
A simple proof for the existence of exponentially balanced Gray codes.
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Improvements on the Juxtaposing Theorem
Gashkov, Igor, Larsson, Henrik (2007)
Serdica Journal of Computing
Similarity:
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.
Divisible Codes - A Survey
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.