Characterization of some Subspaces of (D') by S-asymptotic
Bogoljub Stanković (1987)
Publications de l'Institut Mathématique
Similarity:
Displaying similar documents to “Some number-theoretical properties of generalized sum-of-digit functions”
Characterization of some Subspaces of (D') by S-asymptotic
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)....
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...
A simple proof for the existence of exponentially balanced Gray codes.
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some applications of Bombieri's estimate for exponential sums
Wenpeng Zhang, Yuan Yi (2003)
Acta Arithmetica
Similarity:
Completing codes
A. Restivo, S. Salemi, T. Sportelli (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Divisible Codes - A Survey
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Distribution of values of a real function: Means, moments, and symmetry.
Y.-F.S. Pétermann (1990)
Manuscripta mathematica
Similarity:
The exponential sum over squarefree integers
Jan-Christoph Schlage-Puchta (2004)
Acta Arithmetica
Similarity:
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.