Statistical learning aided decoding of BMST tail-biting convolutional code

X Ma, W Lin, S Cai, B Wei - 2019 IEEE International …, 2019 - ieeexplore.ieee.org
This paper is concerned with block Markov superposition transmission (BMST) of tail-biting
convolutional code (TBCC). We propose a new decoding algorithm for BMST-TBCC, which …

A low latency coding scheme: semi-random block oriented convolutional code

W Lin, S Cai, J Sun, X Ma, B Wei - 2018 IEEE 10th International …, 2018 - ieeexplore.ieee.org
In this paper, we propose a low latency coding scheme called Semi-Random Block Oriented
Convolutional Code (SRBO-CC) which is similar to the Block Markov Superposition …

Sequential decoding of short length binary codes: Performance versus complexity

B Lian, FR Kschischang - IEEE Communications Letters, 2021 - ieeexplore.ieee.org
Sequential decoding of short length binary codes for the additive white Gaussian noise
channel is considered. A variant of the variable-bias term (VBT) metric is introduced …

Iterative soft decoding of reed-solomon tail-biting convolutional concatenated codes

J Ye, TY Wu, J Xing, L Chen - 2020 International Conference …, 2020 - ieeexplore.ieee.org
Reed-Solomon tail-biting convolutional concatenated (RS-TBCC) codes are investigated in
this paper, aiming to eliminate the rate loss caused by the tail bits of the traditional RS …

Twisted-pair superposition transmission for low latency communications

S Cai, X Ma - 2020 IEEE International Symposium on …, 2020 - ieeexplore.ieee.org
In this paper, we propose a novel coding scheme, which is referred to as twisted-pair
superposition transmission (TPST) and can be constructed from any given basic code by" …

A low-complexity maximum-likelihood decoder for tail-biting convolutional codes

YS Han, TY Wu, PN Chen… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Due to the growing interest in applying tail-biting convolutional coding techniques in real-
time communication systems, fast decoding of tail-biting convolutional codes has become an …

Design, performance, and complexity of CRC-aided list decoding of convolutional and polar codes for short messages

J King, H Yao, W Ryan, RD Wesel - arXiv preprint arXiv:2302.07513, 2023 - arxiv.org
Motivated by the need to communicate short control messages in 5G and beyond, this paper
carefully designs codes for cyclic redundancy check (CRC)-aided list decoding of tail-biting …

On tail-biting polarization-adjusted convolutional (TB-PAC) codes and small-sizes list decoding

B Feng, Y Yang, J Jiao, Q Zhang - IEEE Communications …, 2022 - ieeexplore.ieee.org
Polarization-adjusted convolutional (PAC) coding is a good concatenation of convolutional
codes and polar codes. For short block-length codes (), PAC codes with a sequential …

CRC-aided list decoding of convolutional and polar codes for short messages in 5G

J King, A Kwon, H Yang, W Ryan… - ICC 2022-IEEE …, 2022 - ieeexplore.ieee.org
This paper explores list decoding of convolutional and polar codes for short messages such
as those found in the 5G physical broadcast channel. A cyclic redundancy check (CRC) is …

Two step SOVA-based decoding algorithm for tailbiting codes

J Ortin, P Garcia, F Gutierrez… - IEEE communications …, 2009 - ieeexplore.ieee.org
In this work we propose a novel decoding algorithm for tailbiting convolutional codes and
evaluate its performance over different channels. The proposed method consists on a fixed …