Стиснення двійкових послідовностей на основі системи числення Штерна-Броко
The new algorithm of compression is examined without losses for binary sequences, that is based on the use of scale of notation of Shterna–Broko. For the estimation of efficiency of algorithm middle length of binary sequence is determined after a compression, mid-coefficient of compression.
Saved in:
| Date: | 2010 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Фізико-механічний інститут ім. Г.В. Карпенка НАН України
2010
|
| Subjects: | |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/16233 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Стиснення двійкових послідовностей на основі системи числення Штерна-Броко / Л.Я. Глинчук // Відбір і оброб. інформації: Міжвід. зб. наук. пр. — 2010. — Вип. 33(109). — С. 117-122. — Бібліогр.: 6 назв. — укp. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | The new algorithm of compression is examined without losses for binary sequences, that is based on the use of scale of notation of Shterna–Broko. For the estimation of efficiency of algorithm middle length of binary sequence is determined after a compression, mid-coefficient of compression.
|
|---|---|
| ISSN: | 0474-8662 |