Displaying similar documents to “On entropy-like functionals and codes for metrized probability spaces. I.”

On entropy-like functionals and codes for metrized probability spaces II

Miroslav Katětov (1992)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In Part I, we have proved characterization theorems for entropy-like functionals δ , λ , E , Δ and Λ restricted to the class consisting of all finite spaces P ∈ 𝔚 , the class of all semimetric spaces equipped with a bounded measure. These theorems are now extended to the case of δ , λ and E defined on the whole of 𝔚 , and of Δ and Λ restricted to a certain fairly wide subclass of 𝔚 .

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...

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)....