On coding theorem connected with “useful” entropy of order-.
Jain, Priti, Tuteja, R.K. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “An asymptotic Gilbert-Varshamov bound for -nets.”
On coding theorem connected with “useful” entropy of order-.
On entropy-like functionals and codes for metrized probability spaces. I.
Miroslav Katětov (1990)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Joint Range of Rényi entropies
Peter Harremoës (2009)
Kybernetika
Similarity:
The exact range of the joined values of several Rényi entropies is determined. The method is based on topology with special emphasis on the orientation of the objects studied. Like in the case when only two orders of the Rényi entropies are studied, one can parametrize the boundary of the range. An explicit formula for a tight upper or lower bound for one order of entropy in terms of another order of entropy cannot be given.
Families of nets of low and medium strength.
Bierbrauer, Jürgen, Edel, Yves (2005)
Integers
Similarity:
Codes that attain minimum distance in every possible direction
Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)
Open Mathematics
Similarity:
The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.
Optimal discrete entropy.
Shastri, Aditya, Govil, Rekha (2001)
Applied Mathematics E-Notes [electronic only]
Similarity: