Related papers: Telecommand Rejection Probability for CCSDS-compli…
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 integrates a serial list Viterbi algorithm (SLVA) with a soft…
In this paper, we study a compute-and-forward (CAF) relaying scheme with low-density parity-check (LDPC) codes, a special case of physical layer network coding, under the quadrature phase shift keying (QPSK) modulation. The novelty of this…
As the first kind of forward error correction (FEC) codes that achieve channel capacity, polar codes have attracted much research interest recently. Compared with other popular FEC codes, polar codes decoded by list successive cancellation…
Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…
We propose a framework to evaluate the so-called random-coding union bound with parameter $s$ (RCUs) on the achievable error probability in the finite-blocklength regime for a pilot-assisted transmission scheme operating over an imperfectly…
For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…
We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes. We give three kinds of results about linear codes in…
Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical…
Cyclic redundancy check (CRC) codes check if a codeword is correctly received. This paper presents an algorithm to design CRC codes that are optimized for the code-specific error behavior of a specified feedforward convolutional code. The…
Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of cellular mobile communications (5G). In practical scenarios…
Rank metric codes and constant-dimension codes (CDCs) have been considered for error control in random network coding. Since decoder errors are more detrimental to system performance than decoder failures, in this paper we investigate the…
Polar codes under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding…
Accurate knowledge of transmission line (TL) impedance parameters helps to improve accuracy in relay settings and power flow modeling. To improve TL parameter estimates, various algorithms have been proposed in the past to identify TL…
We investigate and compare different options for updating the error correcting code currently used in space mission telecommand links. Taking as a reference the solutions recently emerged as the most promising ones, based on Low-Density…
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…
This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over the BEC can be…
We study the stability of low-density parity-check (LDPC) codes under blockwise or bitwise maximum $\textit{a posteriori}$ (MAP) decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study…
The terahertz (THz) frequency band (0.3-10THz) has the advantage of large available bandwidth and is a candidate to satisfy the ever increasing mobile traffic in wireless communications. However, the THz channels are often absorbed by…
We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while a decentralized setting means there is…
In fact, the broadcast nature of every transmitter makes it possible for other transceivers in the channel to overhear the broadcasted signal. The proposed idea in cooperative communication is to use these intermediate transceivers as relay…