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

## TL;DR

This paper derives formulas for the success probability of decoding (Partial) Unit Memory codes in memoryless channels, showing they can outperform block codes in specific scenarios.

## Contribution

It provides the first analytic expressions for decoding success probability of (Partial) Unit Memory codes in memoryless channels.

## Key findings

- (Partial) Unit Memory codes have higher success probability than block codes in certain channels.
- Analytic formulas enable better understanding of decoding performance.
- Results guide the design of more reliable coding schemes.

## 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.