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.
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.
Uwe Naumann, Jan Riehme (2007)
Computer Science and Information Systems
Similarity:
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity:
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...
D. Long (1992)
Semigroup forum
Similarity:
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)....
A. Restivo, S. Salemi, T. Sportelli (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Hans Hagen (2017)
Zpravodaj Československého sdružení uživatelů TeXu
Similarity:
In LuaTeX, it is now possible to run snippets of Lua code from within MetaPost. The article describes the mechanism, the low-level interface available in LuaTeX, as well as the high-level interface available in ConTeXt through example.
Christophe Denis, Sethy Montan (2012)
ESAIM: Proceedings
Similarity:
Several approximations occur during a numerical simulation: physical effects mapy be discarded, continuous functions replaced by discretized ones and real numbers replaced by finite-precision representations. The use of the floating point arithmetic generates round-off errors at each arithmetical expression and some mathematical properties are lost. The aim of the numerical verification activity at EDF R&D is to study the effect of the round-off error propagation on the results of...
Clelia De Felice, Antonio Restivo (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: