Related papers: Time-Varying Block Codes for Synchronization Error…
We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes…
In magnetic-recording systems, consecutive sections experience different signal to noise ratios (SNRs). To perform error correction over these systems, one approach is to use an individual block code for each section. However, the…
The structure and size of the interleaver used in a turbo code critically affect the distance spectrum and the covariance property of a component decoder's information input and soft output. This paper introduces a new class of…
Block transmission systems have been proven successful over frequency-selective channels. For time-varying channel such as in high-speed mobile communication and underwater communication, existing equalizers assume that channels over…
In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…
Turbo code is a great achievement in the field of communication system. It can be created by connecting a turbo encoder and a decoder serially. A Turbo encoder is build with parallel concatenation of two simple convolutional codes. By…
We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order…
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear…
A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that…
With the fast growth of communication networks, the video data transmission from these networks is extremely vulnerable. Error concealment is a technique to estimate the damaged data by employing the correctly received data at the decoder.…
Recent experimental studies have shown that the relaxation time ($T_1$) and the dephasing time ($T_2$) of superconducting qubits fluctuate considerably over time. To appropriately consider this time-varying nature of the $T_1$ and $T_2$…
Differential encoding and decoding can be employed to circumvent channel estimation in wireless relay networks. This article studies differential amplify-and-forward relaying using linear combining with arbitrary fixed combining weights in…
Multiple antenna (MIMO) devices are widely used to increase reliability and information bit rate. Optimal error rate performance (full diversity and large coding gain), for unknown channel state information at the transmitter and for…
We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However,…
Turbo codes are well known to be one of the error correction techniques which achieve closer results to the Shannon limit. Nevertheless, the specific performance of the code highly depends on the particular decoding algorithm used at the…
Polar codes are a class of linear block codes that provably achieves channel capacity. They have been selected as a coding scheme for the control channel of enhanced mobile broadband (eMBB) scenario for $5^{\text{th}}$ generation wireless…
We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…