Convolutional codes with optimum bidirectional distance profile
From MaRDI portal
Publication:6125766
DOI10.1134/s0032946023030018arXiv2210.15787OpenAlexW4393187325MaRDI QIDQ6125766
Publication date: 11 April 2024
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.15787
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