Lossless text compression by means of binary-coded ternary number representation
-
Published:2024-07
Issue:
Volume:351
Page:15-22
-
ISSN:0166-218X
-
Container-title:Discrete Applied Mathematics
-
language:en
-
Short-container-title:Discrete Applied Mathematics
Reference11 articles.
1. Variable-length prefix codes with multiple delimiters;Anisimov;IEEE Trans. Inf. Theory,2017
2. Robust transmission of unbounded strings using Fibonacci representations;Apostolico;IEEE Trans. Inform. Theory,1987
3. N. Brisaboa, A. Farina, G. Navarro, M. Esteller, (S,C)-dense coding: an optimized compression code for natural language text databases, in: Proc. String Processing and Information Retrieval, (2857) 2003, pp. 122–136.
4. J. Culpepper, A. Moffat, Enhanced Byte Codes with Restricted Prefix Properties, in: String Processing and Information Retrieval: Proc. 12th International Conference, Vol. 3772, 2005, pp. 1–12.
5. J. Duda, K. Tahboub, N. Gadgil, E. Delp, The use of asymmetric numeral systems as an accurate replacement for Huffman coding, in: 2015 Picture Coding Symposium, PCS, 2015, pp. 65–69.