Geodesic
Использование закона Ципфа для сжатия текстов
Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 2, pp. 3-13.

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

@article{DA_2007_14_2_a0,
     author = {M. P. Bakulina},
     title = {{\CYRI}{\cyrs}{\cyrp}{\cyro}{\cyrl}{\cyrsftsn}{\cyrz}{\cyro}{\cyrv}{\cyra}{\cyrn}{\cyri}{\cyre} {\cyrz}{\cyra}{\cyrk}{\cyro}{\cyrn}{\cyra} {{\CYRC}{\cyri}{\cyrp}{\cyrf}{\cyra}} {\cyrd}{\cyrl}{\cyrya} {\cyrs}{\cyrzh}{\cyra}{\cyrt}{\cyri}{\cyrya} {\cyrt}{\cyre}{\cyrk}{\cyrs}{\cyrt}{\cyro}{\cyrv}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--13},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2007_14_2_a0/}
}
TY  - JOUR
AU  - M. P. Bakulina
TI  - Использование закона Ципфа для сжатия текстов
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2007
SP  - 3
EP  - 13
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2007_14_2_a0/
LA  - ru
ID  - DA_2007_14_2_a0
ER  - 
%0 Journal Article
%A M. P. Bakulina
%T Использование закона Ципфа для сжатия текстов
%J Diskretnyj analiz i issledovanie operacij
%D 2007
%P 3-13
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2007_14_2_a0/
%G ru
%F DA_2007_14_2_a0
M. P. Bakulina. Использование закона Ципфа для сжатия текстов. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 2, pp. 3-13. http://geodesic.mathdoc.fr/item/DA_2007_14_2_a0/

[1] Piotrovskii R. G., Tekst, mashina, chelovek, Nauka, L., 1975

[2] Ryabko B. Ya., “Effektivnyi metod kodirovaniya istochnikov informatsii, ispolzuyuschii algoritm bystrogo umnozheniya”, Problemy peredachi informatsii, 31:1 (1995), 3–12 | MR | Zbl

[3] Fikhtengolts G. M., Kurs differentsialnogo i integralnogo ischisleniya, T. 2, Fizmatlit, M., 2001

[4] Khaffman D. A., “Metod postroeniya kodov s minimalnoi izbytochnostyu”, Kiberneticheskii sbornik, Vyp. 3, IL, M., 1961, 79–87

[5] Bell T. C., Cleary J. H., Witten I. H., Text compression, Prentice Hall. Englewood Cliffs, 1990

[6] Bentley J. L., Sleator D. D., Tarjan R. E., “A locally adaptive data compression scheme”, Commun. ACM, 29:2 (1986), 320–330 | DOI | MR | Zbl

[7] Elias P., “Interval and recency rank source encoding: two on-line adaptive variable-length schemes”, IEEE Trans. Inform. Theory, 33:1 (1987), 3–10 | DOI | MR | Zbl

[8] Mandelbrot B., On recurrent noise limiting coding, Lab. d'Electronique et de physique appliquces, Paris, 1954 ; Mandelbrot B., “O rekurrentnom kodirovanii, ogranichivayuschem vliyanie pomekh”, Teoriya peredachi soobschenii, IL, M., 1957, 139–157 | MR

[9] Mandelbrot B., “On the theory of word frequencies and on related markovian models of discourse”, The structure of language and its mathematical aspects, Proceeding Symposium on Applied Mathematics, 12, Amer. Math. Soc., Providence, RI, 1961, 190–219

[10] Moffat A. M., “Word based text compression”, Software-Practice and Experience, 19:2 (1989), 185–198 | DOI

[11] Schwartz E. S., “A dictionary for minimal redundancy encoding”, J. Assoc. Comput. Mach., 10:4 (1963), 413–439 | Zbl

[12] Welch T. A., “A technique for high-performance data compression”, IEEE Computers, 17:6 (1984), 8–19

[13] Zipf G. K., Human behavior and the principle of least effort, Addison Wesley, Cambridge, 1949

[14] Ziv J., Lempel A., “A universal algorithm for sequential data compression”, IEEE Trans. Inform. Theory, IT-23:3 (1977), 337–343 | DOI | MR

[15] Ziv J., Lempel A., “Compression of individual sequences via variable-length coding”, IEEE Trans. Inform. Theory, IT-24:5 (1978), 530–536 | DOI | MR