Papers
Topics
Authors
Recent
Search
2000 character limit reached

Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code

Published 23 Jul 2016 in cs.IT and math.IT | (1607.06914v1)

Abstract: Homophonic coding is a framework to reversibly convert a message into a sequence with some target distribution. This is a promising tool to generate a codeword with a biased code-symbol distribution, which is required for capacity-achieving communication by asymmetric channels. It is known that asymptotically optimal homophonic coding can be realized by a Fixed-to-Variable (FV) length code using an interval algorithm similar to a random number generator. However, FV codes are not preferable as a component of channel codes since a decoding error propagates to all subsequent codewords. As a solution for this problem an asymptotically optimal Variable-to-Fixed (VF) length homophonic code, dual Shannon-Fano-Elias-Gray (dual SFEG) code, is proposed in this paper. This code can be interpreted as a dual of a modified Shannon-Fano-Elias (SFE) code based on Gray code. It is also shown as a by-product that the modified SFE code, named SFEG code, achieves a better coding rate than the original SFE code in lossless source coding.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.