A Loopless Implementation of a Gray Code for Signed Permutations
James Korsh, Paul LaFollette, Seymour Lipschutz (2011)
Publications de l'Institut Mathématique
Similarity:
Displaying similar documents to “Note on Gray Codes for Permutation Lists”
A Loopless Implementation of a Gray Code for Signed Permutations
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...
New upper bounds for the size of permutation codes via linear programming.
Bogaerts, Mathieu (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A simple proof for the existence of exponentially balanced Gray codes.
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The check positions of Hamming codes and the construction of a 2EC-AUED code.
How, Guan Aun, Ang, Miin Huey (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
Code Cache Management Based on Working Set in Dynamic Binary Translator
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity:
On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes
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...
Ternary constant weight codes.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A new table of constant weight codes of length greater than 28.
Smith, D.H., Hughes, L.A., Perkins, S. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a complete set of operations for factorizing codes
Clelia De Felice (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes)....
Creation of unequal error protection codes for two groups of symbols
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.