Writing on the Facade of RWTH ICT Cubes: Cost Constrained Geometric Huffman Coding


G. Böcherer, F. Altenbach, M. Malsbender, R. Mathar,


        In this work, a coding technique called cost constrained Geometric Huffman coding (CCGHC) is developed. CCGHC minimizes the Kullback-Leibler distance between a dyadic probability mass function (pmf) and a target pmf subject to an affine inequality constraint. An analytical proof is given that when CCGHC is applied to blocks of symbols, the optimum is asymptotically achieved when the blocklength goes to infinity. The derivation of CCGHC is motivated by the problem of encoding a text to a sequence of slats subject to architectural design criteria. For the considered architectural problem, for a blocklength of 3, the codes found by CCGHC match the design criteria. For communications channels with average cost constraints, CCGHC can be used to efficiently find prefix-free modulation codes that are provably capacity achieving.

BibTEX Reference Entry 

	author = {Georg B{\"o}cherer and Fabian Altenbach and Martina Malsbender and Rudolf Mathar},
	title = "Writing on the Facade of {RWTH} ICT Cubes: Cost Constrained Geometric Huffman Coding",
	pages = "231-235",
	booktitle = "International Symposium on Wireless Communication 2011",
	address = {Aachen, Deutschland},
	month = Nov,
	year = 2011,
	hsb = hsb999910117219,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.