On the structure of some group codes.
D. Long (1992)
Semigroup forum
Similarity:
Displaying similar documents to “On the degree of finite maximal biprefix codes.”
On the structure of some group codes.
Limited semaphore codes.
M. Satyanarayana, S. Mohanty (1992)
Semigroup forum
Similarity:
Uniformly synchronous codes.
M. Satyanarayana (1993)
Semigroup forum
Similarity:
A note on r-extensible prefix codes.
S. Zhang (1989)
Semigroup forum
Similarity:
Uniformly synchronous limited codes.
M. Satyanarayana, S. Mohanty (1993)
Semigroup forum
Similarity:
Irrationality and codes.
P.G. Becker, J.W. Sander (1995)
Semigroup forum
Similarity:
Maximal circular codes maximal codes
Yannick Guesnet (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.
Semisimplicity of the algebra associated to a biprefix code.
C. Reutenauer (1981)
Semigroup forum
Similarity:
Maximal prefix products.
V. Bruyère (1987)
Semigroup forum
Similarity:
A synchronization property of pure subsemigroups.
Aldo de Luca, Antonio Restivo (1981)
Semigroup forum
Similarity:
Completing codes
A. Restivo, S. Salemi, T. Sportelli (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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...