Maximum-likelihood (ML) decoding of tail-biting convolutional codes (TBCCs) with S= 2^v
states traditionally requires a separate S-state trellis for each of the S possible …

Traditionally, a hybrid automatic repeat request (HARQ) is executed at the physical (PHY)
and medium access control (MAC) layers. A cyclic redundancy check (CRC) is usually …

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 …

In this paper, a new list decoding algorithm for tail-biting convolutional codes (TBCCs) with a
cyclic redundancy check (CRC) is proposed, where the CRC is considered as a …

Tail-biting codes are efficient for short data packets by eliminating the rate loss in
conventional known-tail codes. The existing maximum-likelihood (ML) decoding algorithms …

The A* algorithm is a graph search algorithm which has shown good results in terms of
computational complexity for Maximum Likelihood (ML) decoding of tailbiting convolutional …

Tail-biting codes are efficient coding techniques to eliminate the rate loss in conventional
known-tail convolutional codes at a cost of increased complexity in decoders. In addition, tail …

Tail-biting convolutional codes (TBCC) provide an efficient method to eliminate the rate loss
caused by the known-tail encoding. To simplify the decoder design, circular Viterbi algorithm …

In this paper, we present a novel algorithm that guarantees of finding a variable-length error-
correcting code (VLEC) with minimal average codeword length for a fixed free distance d …

In this work, we proposed a reliability-based enhancement for the decoding of convolutional
tail-biting codes (CTBC) from the observations that the decoding does not have to start from …