Please use this identifier to cite or link to this item: http://essuir.sumdu.edu.ua/handle/123456789/1627
Or use following links to share this resource in social networks: Recommend this item
Title Метод сжатия на основе комбинаторного разложения передаваеміх сообщений на классы эквивалентности
Authors Borysenko, Oleksii Andriiovych  
Zuban, Yurii Oleksandrovych  
ORCID http://orcid.org/0000-0001-7466-9135
http://orcid.org/0000-0002-6596-894X
Keywords
Type Article
Date of Issue 2003
URI http://essuir.sumdu.edu.ua/handle/123456789/1627
Publisher Издательство СумГУ
License
Citation Борисенко, А.А. Метод сжатия на основе комбинаторного разложения передаваеміх сообщений на классы эквивалентности [Текст] / А.А. Борисенко, Ю.А. Зубань // Вісник Сумського державного університету. Серія Технічні науки. — 2003. — №11(57). — С. 88-99.
Abstract In this article it is given the main algorithm of optimal encoding for method of data compression called local shifts. The new algorithm allows to get the Shennon-Fano code without calculating any probabilities. It enhances speed of compression. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/1627
Appears in Collections: Вісник Сумського державного університету. Технічні науки (2007-2014)

Views

China China
373
Germany Germany
374
Greece Greece
1
Iran Iran
1
Ireland Ireland
164771
Latvia Latvia
1
Lithuania Lithuania
1
Netherlands Netherlands
6
Russia Russia
34
Singapore Singapore
306004413
Sweden Sweden
1
Turkey Turkey
4
Ukraine Ukraine
5429089
United Kingdom United Kingdom
2725233
United States United States
570174075
Unknown Country Unknown Country
5429087

Downloads

Bulgaria Bulgaria
1
Canada Canada
9
Germany Germany
42757
Japan Japan
1
Kazakhstan Kazakhstan
1
Latvia Latvia
42757
Lithuania Lithuania
1
Russia Russia
14336796
Spain Spain
1
Sweden Sweden
1
Ukraine Ukraine
194836957
United Kingdom United Kingdom
1
United States United States
570174075
Unknown Country Unknown Country
5429088
Uzbekistan Uzbekistan
306004414

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.