The design of block codes for short information blocks (eg, a thousand or less information
bits) is an open research problem that is gaining relevance thanks to emerging applications …

The design of block codes for short information blocks (eg, a thousand or less information
bits) is an open research problem which is gaining relevance thanks to emerging …

Motivated by the increasing interest in powerful short channel codes for low-latency ultra-
reliable communications, we analyze the performance of tail-biting convolutional codes with …

This paper presents a general approach for optimizing the number of symbols in increments
(packets of incremental redundancy) in a feedback communication system with a limited …

This paper presents a variable-length decision-feedback coding scheme that achieves high
rates at short blocklengths. This scheme uses the reliability-output Viterbi algorithm (ROVA) …

In this paper, a novel simplified statistical approach to evaluate the error performance bound
of Ordered Statistics Decoding (OSD) of Linear Block Codes (LBC) is investigated. First, we …

In this work we introduce a framework to study the trade-off between the undetected error
rate (UER) and overall frame error rate (FER) of CRC-concatenated polar codes in the short …

Cyclic redundancy check (CRC) codes combined with convolutional codes yield a powerful
concatenated code that can be efficiently decoded using list decoding. To help design such …

This paper uses a case study of a tail-biting convolutional code (with successful decoding
indicated by the reliability output Viterbi algorithm) to present an information density …

Variable-length (VL) coding sends an initial codeword followed by subsequent
transmissions of incremental redundancy (IR) sent when the decoder indicates through …