Joint source-channel coding using variable-length codes

From MaRDI portal





The paper presents a decoding algorithm for joint source-channel coding when variable-length codes are used for information transmission over a discrete memoryless channel. The asymptotic lower bound on the exponent of the decoding error probability for variable-length codes has been established. For a subclass of discrete memoryless sources and discrete memoryless channels, this bound is asymptotically tight.











This page was built for publication: Joint source-channel coding using variable-length codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951358)