Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate

2012/02/08 by Antonia Wachter-Zeh, Wachter-Zeh, Antonia, Markus Stinner +3 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #Coding theory and cryptography #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1202.1692

openalex publication_date 2012/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Partial Unit Memory (PUM) codes are a special class of convolutional codes, which are often constructed by means of block codes. Decoding of PUM codes may take advantage of existing decoders for the block code. The Dettmar--Sorger algorithm is an efficient decoding algorithm for PUM codes, but allows only low code rates. The same restriction holds for several known PUM code constructions. In this paper, an arbitrary-rate construction, the analysis of its distance parameters and a generalized decoding algorithm for PUM codes of arbitrary rate are provided. The correctness of the algorithm is proven and it is shown that its complexity is cubic in the length.

Cited by

• A Matrix Completion Approach for the Construction of MDP Convolutional Codes

Related

• On the Success Probability of Decoding (Partial) Unit Memory Codes
• Low-Complexity Decoding of a Class of Reed-Muller Subcodes for Low-Capacity Channels
• On Pseudocodewords and Improved Union Bound of Linear Programming\n Decoding of HDPC Codes
• Recursive Decoding of Reed-Muller Codes Starting With the Higher-Rate Constituent Code
• Convolutional codes from unit schemes