pith. sign in

arxiv: 1705.08652 · v1 · pith:W26RET7Fnew · submitted 2017-05-24 · 💻 cs.IT · math.IT

On the Success Probability of Decoding (Partial) Unit Memory Codes

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

In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that these codes outperform individual block codes in certain channels.

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.