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

DOI10.1016/J.DAM.2024.03.003MaRDI QIDQ6495256FDOQ6495256

Authors: I. O. Zavadskï 

Publication date: 30 April 2024

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

zbMATH Keywords

codecompressionternarynatural language

Mathematics Subject Classification ID

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

Cites Work

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

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)