Natural-Language Text Compression Using Reverse Multi-Delimiter Codes

DOI10.1007/S10559-024-00641-2MaRDI QIDQ6495168

I. O. Zavadskyi, Anatoly V. Anisimov, Unnamed Author

Publication date: 30 April 2024

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Robust transmission of unbounded strings using Fibonacci representations
• Regular universal codeword sets (Corresp.)
• Universal codeword sets and representations of the integers
• Maximal Prefix-Synchronized Codes
• A Method for the Construction of Minimum-Redundancy Codes
• String Processing and Information Retrieval

This page was built for publication: Natural-Language Text Compression Using Reverse Multi-Delimiter Codes