A unimodality property of optimal exhaustive prefix codes and retrieval trees over alphabets of varying size

DOI10.1016/0306-4379(77)90008-4MaRDI QIDQ1240193zbMATH OpenOpenAlexFDO

Authors Larry E. Stanfel

Publication date 1977

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0306-4379(77)90008-4

Mathematics Subject Classification ID

Trees (05C05) Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)

This page was built for publication: A unimodality property of optimal exhaustive prefix codes and retrieval trees over alphabets of varying size

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