Back to Results
First PageMeta Content
Data compression / Software engineering / Trie / Video compression / Radix tree / Lossless data compression / Arithmetic coding / C / Linked list / Computing / Computer programming / Prediction by partial matching


Unbounded length contexts for PPM John G. Cleary, W. J. Teahan, Ian H. Witten Department of Computer Science, University of Waikato, New Zealand
Add to Reading List

Document Date: 1998-12-21 21:34:37

Open Document

File Size: 308,72 KB

Share Result on Facebook

City

Providence / Reading / Calgary / Palo Alto / /

Company

PPM / Digital Equipment Corporation / /

Country

New Zealand / /

/

Facility

Prentice Hall / Brown University / University of Waikato / /

IndustryTerm

cient lossless data compression systems / block-sorting algorithm / block-sorting lossless data compression algorithm / exclusion device / /

Organization

University of Waikato / Brown University / Ian H. Witten Department of Computer Science / /

Person

Wheeler / John G. Cleary / Ian H. Witten / Thomas Hardy / /

Position

D.J. / /

ProvinceOrState

Rhode Island / California / Massachusetts / /

PublishedMedium

IEEE Transactions on Communications / IEEE Transactions on Information Theory / Communications of the ACM / /

Technology

block-sorting lossless data compression algorithm / block-sorting algorithm / /

SocialTag