Geodesic
On the concept of underdetermined alphabets of equal strength
Prikladnaâ diskretnaâ matematika, no. 3 (2014), pp. 40-57.

Voir la notice de l'article provenant de la source Math-Net.Ru

For underdetermined alphabets, the following two concepts are defined: a) one alphabet is stronger than another, and b) two alphabets have equal strength. To define concepts (a) and (b), several approaches are used. The functional approach is based on expressibility of one alphabet via another; three other approaches – combinatorial, probabilistic, and algorithmic – are terminologically connected with the Kolmogorov's approaches to the notion of the amount of information. It is proved that all these approaches to the comparison of alphabets are equivalent. In case (b), a solution of the optimal compression problem for one of the alphabets, in fact, solves the same problem for the other. It is shown that the concepts (a) and (b) allow polynomial time verification.
Keywords: underdetermined alphabet, alphabets of equal strength, entropy of underdetermined data, Kolmogorov complexity. 
@article{PDM_2014_3_a3,
     author = {L. A. Sholomov},
     title = {On the concept of underdetermined alphabets of equal strength},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {40--57},
     publisher = {mathdoc},
     number = {3},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2014_3_a3/}
}
TY  - JOUR
AU  - L. A. Sholomov
TI  - On the concept of underdetermined alphabets of equal strength
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2014
SP  - 40
EP  - 57
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2014_3_a3/
LA  - ru
ID  - PDM_2014_3_a3
ER  - 
%0 Journal Article
%A L. A. Sholomov
%T On the concept of underdetermined alphabets of equal strength
%J Prikladnaâ diskretnaâ matematika
%D 2014
%P 40-57
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2014_3_a3/
%G ru
%F PDM_2014_3_a3
L. A. Sholomov. On the concept of underdetermined alphabets of equal strength. Prikladnaâ diskretnaâ matematika, no. 3 (2014), pp. 40-57. http://geodesic.mathdoc.fr/item/PDM_2014_3_a3/

[1] Kolmogorov A. N., “Tri podkhoda k opredeleniyu ponyatiya ‘kolichestvo informatsii’ ”, Problemy peredachi informatsii, 1:1 (1965), 3–11 | MR | Zbl

[2] Sholomov L. A., “Preobrazovanie nechetkikh dannykh s sokhraneniem informatsionnykh svoistv”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 12:3 (2005), 85–104 | MR | Zbl

[3] Sholomov L. A., “Razlozhenie nedoopredelennykh dannykh”, Diskretnyi analiz i issledovanie operatsii, 19:6 (2012), 72–98 | MR

[4] Gallager R., Teoriya informatsii i nadezhnaya svyaz, Sov. radio, M., 1974, 720 pp. | Zbl

[5] Sholomov L. A., “Elementy teorii nedoopredëlennoi informatsii”, Prikladnaya diskretnaya matematika. Prilozhenie, 2009, no. 2, 18–42

[6] Sholomov L. A., “O funktsionalakh, kharakterizuyuschikh slozhnost sistem nedoopredelennykh bulevykh funktsii”, Problemy kibernetiki, 19, Nauka, M., 1967, 123–139

[7] Potapov V. N., “Obzor metodov neiskazhayuschego kodirovaniya diskretnykh istochnikov”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 6:4 (1999), 49–91 | MR | Zbl

[8] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982, 416 pp. | MR