pith. sign in

arxiv: 1706.06775 · v2 · pith:CBIPBSYQnew · submitted 2017-06-21 · 💻 cs.IT · math.IT

Variable-to-Fixed Length Homophonic Coding Suitable for Asymmetric Channel Coding

classification 💻 cs.IT math.IT
keywords homophoniccodeasymmetriccodingdistributionchannelchannelscodes
0
0 comments X
read the original abstract

In communication through asymmetric channels the capacity-achieving input distribution is not uniform in general. Homophonic coding is a framework to invertibly convert a (usually uniform) message into a sequence with some target distribution, and is a promising candidate to generate codewords with the nonuniform target distribution for asymmetric channels. In particular, a Variable-to-Fixed length (VF) homophonic code can be used as a suitable component for channel codes to avoid decoding error propagation. However, the existing VF homophonic code requires the knowledge of the maximum relative gap of probabilities between two adjacent sequences beforehand, which is an unrealistic assumption for long block codes. In this paper we propose a new VF homophonic code without such a requirement by allowing one-symbol decoding delay. We evaluate this code theoretically and experimentally to verify its asymptotic optimality.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.