Convolutional codes with optimum bidirectional distance profile
From MaRDI portal
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.
Recommendations
- Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
- Robustly optimal rate one-half binary convolutional codes (Corresp.)
- Convolutional codes with maximum distance profile
- Bidirectional sequential decoding
- New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
Cites work
- An analysis of sequential decoding for specific time-invariant convolutional codes
- BEAST Decoding of Block Codes Obtained Via Convolutional Codes
- Bidirectional sequential decoding
- Fast Sequential Decoding Algorithm Using a Stack
- Further results on binary convolutional codes with an optimum distance profile (Corresp.)
- High rate convolutional codes with good distance profiles (Corresp.)
- New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
- 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.)
This page was built for publication: Convolutional codes with optimum bidirectional distance profile
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125766)
