Lossless text compression by means of binary-coded ternary number representation

DOI10.1016/J.DAM.2024.03.003MaRDI QIDQ6495256zbMATH OpenFDO

Authors I. O. Zavadskï

Publication date 30 April 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.03.003

zbMATH Keywords

codecompressionnatural languageternary

Mathematics Subject Classification ID

Theory of data (68Pxx) Theory of computing (68Qxx) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
• A Method for the Construction of Minimum-Redundancy Codes
• Algorithms for Binary Coded Balanced and Ordinary Ternary Operations
• scientific article; zbMATH DE number 6765487 (Why is no real title available?)
• Robust transmission of unbounded strings using Fibonacci representations
• Universal codeword sets and representations of the integers

This page was built for publication: Lossless text compression by means of binary-coded ternary number representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495256)