Geodesic
Universal encoding of Markov's sources by symbols with varying durations
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 3, pp. 71-83.

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

An algorithm of universal coding of the information generated by an unknown Markov's source by symbols with varying durations is offered and its optimality is proved. Bibliogr. 17.
Keywords: entropy, coding, the cost of encoding, capacity
Mots-clés : source. 
@article{DA_2013_20_3_a4,
     author = {V. K. Trofimov and T. V. Khramova},
     title = {Universal encoding of {Markov's} sources by symbols with varying durations},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {71--83},
     publisher = {mathdoc},
     volume = {20},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_3_a4/}
}
TY  - JOUR
AU  - V. K. Trofimov
AU  - T. V. Khramova
TI  - Universal encoding of Markov's sources by symbols with varying durations
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 71
EP  - 83
VL  - 20
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_3_a4/
LA  - ru
ID  - DA_2013_20_3_a4
ER  - 
%0 Journal Article
%A V. K. Trofimov
%A T. V. Khramova
%T Universal encoding of Markov's sources by symbols with varying durations
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 71-83
%V 20
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_3_a4/
%G ru
%F DA_2013_20_3_a4
V. K. Trofimov; T. V. Khramova. Universal encoding of Markov's sources by symbols with varying durations. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 3, pp. 71-83. http://geodesic.mathdoc.fr/item/DA_2013_20_3_a4/

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

[2] Krichevskii R. E., “Svyaz mezhdu izbytochnostyu kodirovaniya i dostovernostyu svedenii ob istochnike”, Probl. peredachi inform., 4:3 (1968), 48–57 | MR | Zbl

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

[4] Ryabko B. Ya., “Kodirovanie istochnika s neizvestnymi, no uporyadochennymi veroyatnostyami”, Probl. peredachi inform., 15:2 (1979), 71–77 | MR | Zbl

[5] Ryabko B. Ya., “Dvazhdy universalnoe kodirovanie”, Probl. peredachi inform., 20:3 (1984), 24–28 | MR | Zbl

[6] Trofimov V. K., “Izbytochnost universalnogo kodirovaniya proizvolnykh markovskikh istochnikov”, Probl. peredachi inform., 10:4 (1974), 16–24 | MR | Zbl

[7] Trofimov V. K., Khramova T. V., “Szhatie neravnoznachnymi simvolami informatsii, porozhdënnoi neizvestnym istochnikom bez pamyati”, Avtometriya, 48:1 (2012), 30–44

[8] Fano R., Peredacha informatsii. Statisticheskaya teoriya svyazi, Mir, M., 1965, 440 pp. | MR | Zbl

[9] Fitingof B. M., “Optimalnoe kodirovanie pri neizvestnoi i menyayuscheisya statistike soobschenii”, Probl. peredachi inform., 2:2 (1966), 3–11 | MR | Zbl

[10] Chisar I., “O kanalakh bez shuma”, Probl. peredachi inform., 6:4 (1970), 3–15 | MR | Zbl

[11] Shennon K., Matematicheskaya teoriya svyazi, Raboty po teorii informatsii i kibernetike, Izd-vo inostr. lit., M., 1969, 243–332

[12] Shtarkov Yu. M., “Kodirovanie soobschenii konechnoi dliny na vykhode istochnika s neizvestnoi statistikoi”, Mat. V konf. po teorii kodirovaniya i peredachi inf., Ch. 1, Moskva–Gorkii, 1972, 147–152

[13] Davisson L. D., “Universal noiseless coding”, IEEE Trans. Inform. Theory, 19:6 (1973), 783–795 | DOI | MR | Zbl

[14] Elias P., “Universal codeword sets and representations of the integers”, IEEE Trans. Inform. Theory, 21:2 (1975), 194–203 | DOI | MR | Zbl

[15] Katona G., General theory of noiseless channels, Courses and lectures, 31, UDINE, 1970, 69 pp.

[16] Krichevsky R. E., Trofimov V. K., “The performance of universal encoding”, IEEE Trans. Inform. Theory, 27:2 (1981), 199–207 | DOI | MR | Zbl

[17] Verdu S., “Fifty years of Shannon theory”, IEEE Trans. Inform. Theory, 44:6 (1998), 2057–2078 | DOI | MR | Zbl