Algorithm 938: Compressing circular buffers

DOI10.1145/2559995MaRDI QIDQ5498693zbMATH OpenOpenAlexWikidataFDO

Authors John C. Gunther

Publication date 10 February 2015

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2559995

zbMATH Keywords

maximumsumnumber theorymodular arithmeticdata aggregationlossy compressionminimumdoublingrelatively primerandom samplecomplete residue systemdata sequencecompressing circular bufferdynamically sized arrays

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Combinatorial compression algorithms for ordered record sequences
• scientific article; zbMATH DE number 4045113
• A universal algorithm for sequential data compression
• Compression of almost-periodic data.
• Compror: On-line lossless data compression with a factor oracle.

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3247276 (Why is no real title available?)
• scientific article; zbMATH DE number 3355099 (Why is no real title available?)
• Algorithms for Computing the Sample Variance: Analysis and Recommendations
• Shift Register Sequences – A Retrospective Account
• The difference between consecutive primes. II

Cited in

(1)

• Algorithm 938

This page was built for publication: Algorithm 938: Compressing circular buffers

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