An optimum encoding with minimum longest code and total number of digits

DOI10.1016/S0019-9958(64)90241-4MaRDI QIDQ5726080zbMATH OpenFDO

Authors Eugene S. Schwartz

Publication date 1964

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(64)90241-4

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• A Method for the Construction of Minimum-Redundancy Codes
• scientific article; zbMATH DE number 2036351
• scientific article; zbMATH DE number 4210044
• scientific article; zbMATH DE number 4063000
• scientific article; zbMATH DE number 1543071

Cited in

(11)

• Mathematical optimization and the synchronizing properties of encodings
• Best Huffman trees
• Huffman's algorithm via algebra
• Encoding Nearest Larger Values
• Exact and approximation algorithms for error-detecting even codes
• Parity codes
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal binary search trees
• Old and new results on alphabetic codes
• Dynamic Shannon coding
• New optimization models for designing synchronizing codes

This page was built for publication: An optimum encoding with minimum longest code and total number of digits

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