Back to Search
Start Over
Lossless text compression by means of binary-coded ternary number representation.
- Source :
-
Discrete Applied Mathematics . Jul2024, Vol. 351, p15-22. 8p. - Publication Year :
- 2024
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 351
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 176647347
- Full Text :
- https://doi.org/10.1016/j.dam.2024.03.003