Natural-Language Text Compression Using Reverse Multi-Delimiter Codes

DOI10.1007/S10559-024-00641-2MaRDI QIDQ6495168zbMATH OpenFDO

Authors Anatoly V. Anisimov, I. O. Zavadskï

Publication date 30 April 2024

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

Full work available at URL https://doi.org/10.1007/S10559-024-00641-2

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

• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
• A Method for the Construction of Minimum-Redundancy Codes
• scientific article; zbMATH DE number 1975048 (Why is no real title available?)
• scientific article; zbMATH DE number 6765487 (Why is no real title available?)
• Maximal Prefix-Synchronized Codes
• Regular universal codeword sets (Corresp.)
• Robust transmission of unbounded strings using Fibonacci representations
• Universal codeword sets and representations of the integers

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

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