Note on Gray Codes for Permutation Lists
Seymour Lipschutz, Jie Gao, Dianjun Wang (2005)
Publications de l'Institut Mathématique
Similarity:
Seymour Lipschutz, Jie Gao, Dianjun Wang (2005)
Publications de l'Institut Mathématique
Similarity:
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Michał Kolarz (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.
Smith, D.H., Hughes, L.A., Perkins, S. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How, Guan Aun, Ang, Miin Huey (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
Bogaerts, Mathieu (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Manev, Mladen (2009)
Serdica Journal of Computing
Similarity:
Partially supported by the Technical University of Gabrovo under Grant C-801/2008 One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values...
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...
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity: