Abstract
A lossless data compression code based on a binary-coded ternary number representation is investigated. The code is complete, universal, synchronizable, and supports a direct search in a compressed file. A simple monotonous encoding and very fast decoding algorithms are constructed owing to code properties. Experiments show that in natural language text compression, the new code outperforms byte-aligned codes SCDC and RPBC either in compression ratio or in decoding speed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
