On the redundancy of \(D\)-ary Fano codes

DOI10.1007/978-3-030-67731-2_19zbMath1492.94048OpenAlexW3124795696MaRDI QIDQ831818

Ferdinando Cicalese, Massimiliano Rossi

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_19

zbMATH Keywords

redundancy\(D\)-ary aggregations\(D\)-ary Fano codes

Mathematics Subject Classification ID

Dynamic programming (90C39) Source coding (94A29)

Cites Work

• New bounds on \(D\)-ary optimal codes
• Correctness of constructing optimal alphabetic trees revisited
• Twenty (short) questions
• Optimum binary search trees
• Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
• Application of heuristic search and information theory to sequential fault diagnosis
• An improved bound for weight-balanced tree
• A New Algorithm for Minimum Cost Binary Trees
• Elements of Information Theory
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Penetration and Diffusion of X-Rays through Thick Barriers. II. The Asymptotic Behavior when Pair Production Is Important

This page was built for publication: On the redundancy of \(D\)-ary Fano codes