Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Data compression by means of a ``book stack

From MaRDI portal
Publication:1155580
Jump to:navigation, search

zbMath0466.94007MaRDI QIDQ1155580

Boris Ya. Ryabko

Publication date: 1980

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/ppi1458



Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)


Related Items (6)

Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Efficient chain code compression with interpolative coding ⋮ On some statistical properties of the ``Book Stack transformation ⋮ Time-universal data compression ⋮ Asymptotically most powerful tests for random number generators ⋮ On Undetected Redundancy in the Burrows-Wheeler Transform







This page was built for publication: Data compression by means of a ``book stack

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1155580&oldid=13215133"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki