Bounding the Compression Loss of the FGK Algorithm

DOI10.1006/JAGM.1999.1012MaRDI QIDQ4264494zbMATH OpenOpenAlexFDO

Authors Artur Alves Pessoa, Ruy L. Milidiú, Eduardo S. Laber

Publication date 9 June 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1012

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• A nearly-optimal Fano-based coding algorithm
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
• On-line adaptive canonical prefix coding with bounded compression loss
• The fractional greedy algorithm for data compression
• Move-to-front, distance coding, and inversion frequencies revisited

Cited in

(7)

• Minimax trees in linear time with applications
• A fast algorithm for adaptive prefix coding
• Worst-Case Optimal Adaptive Prefix Coding
• Exact and approximation algorithms for error-detecting even codes
• Parity codes
• Simple worst-case optimal adaptive prefix-free coding
• Dynamic Shannon coding

Describes a project that uses

Uses Software

• Algorithm 673

This page was built for publication: Bounding the Compression Loss of the FGK Algorithm

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