Two conjectures about recency rank encoding

MaRDI QIDQ2960895zbMATH OpenFDO

Authors Chris Buhse, William Linz, Matthew J. Simpson, P. D. jun. Johnson

Publication date 17 February 2017

Full work available at URL http://ijmcs.future-in-tech.net/10.2/R-Johnson2.pdf

zbMATH Keywords

Huffman's algorithmreplacement codingsource codingsource frequencieszeroth order source

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Symmetric functions and generalizations (05E05) Inequalities for sums, series and integrals (26D15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 7491383
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• Fixed-prefix encoding of the integers can be Huffman-optimal
• scientific article; zbMATH DE number 4127149
• Optimal source coding for a class of integer alphabets (Corresp.)

Cited in

(3)

• Predicting immediate ordered recall of lists with products of probabilities
• Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
• scientific article; zbMATH DE number 7491383 (Why is no real title available?)

This page was built for publication: Two conjectures about recency rank encoding

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