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

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

2011-06-28

arxiv.org/abs/1106.5675v1

Computer Science

Information Theory

5 pages, submitted to ISWCS 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Writing on the Facade of RWTH ICT Cubes: Cost Constrained Geometric Huffman Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Writing on the Facade of RWTH ICT Cubes: Cost Constrained Geometric Huffman Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Writing on the Facade of RWTH ICT Cubes: Cost Constrained Geometric Huffman Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41411