Convolutional codes with optimum bidirectional distance profile

DOI10.1134/S0032946023030018arXiv2210.15787OpenAlexW4393187325MaRDI QIDQ6125766

Ivan Stanojević, Vojin Šenk

Publication date: 11 April 2024

Published in: Problems of Information Transmission (Search for Journal in Brave)

Abstract: In this paper we present tables of convolutional codes with an optimum bidirectional distance profile (OBDP), defined as the minimum of the distance profiles of the code and its corresponding "reverse" code. Such codes minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their "prefixes", and that OBDP codes can be obtained by "concatenating" ODP and reverse ODP codes of smaller memory.

Full work available at URL: https://arxiv.org/abs/2210.15787

zbMATH Keywords

convolutional codesdistance profilebidirectional decoding

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• BEAST Decoding of Block Codes Obtained Via Convolutional Codes
• Robustly optimal rate one-half binary convolutional codes (Corresp.)
• Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.)
• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• High rate convolutional codes with good distance profiles (Corresp.)
• Further results on binary convolutional codes with an optimum distance profile (Corresp.)
• An analysis of sequential decoding for specific time-invariant convolutional codes
• Bidirectional sequential decoding
• New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
• Fast Sequential Decoding Algorithm Using a Stack

This page was built for publication: Convolutional codes with optimum bidirectional distance profile