Heilmann, Wolf-Rüdiger A remark on the connections between coding and dynamic programming. (English) Zbl 0451.94004 Inf. Sci. 21, 209-212 (1980). Page: Show Scanned Page MSC: 94A24 Coding theorems (Shannon theory) 90C39 Dynamic programming 94B05 Linear codes (general theory) Keywords:binary code; minimal average length; finite set of messages; Huffman code PDFBibTeX XMLCite \textit{W.-R. Heilmann}, Inf. Sci. 21, 209--212 (1980; Zbl 0451.94004) Full Text: DOI References: [1] Abramson, N., Information Theory and Coding (1963), McGraw-Hill: McGraw-Hill New York [2] Hinderer, K., Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter, (Lecture Notes in Operations Research and Mathematical Programming (1970), Springer: Springer Berlin), No. 33 · Zbl 0202.18401 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.