Related papers: Joint Write-Once-Memory and Error-Control Codes
Bosonic codes encode quantum information into a single infinite-dimensional physical system endowed with error correction capabilities. This reduces the need for complex management of many physical constituents compared with standard…
The goal of combining beamforming and space-time coding in this work is to obtain full-diversity order and to provide additional received power (array gain) compared to conventional space-time codes. In our system, we consider a…
Channel polarization is a phenomenon in which a particular recursive encoding induces a set of synthesized channels from many instances of a memoryless channel, such that a fraction of the synthesized channels becomes near perfect for data…
We evaluate the information capacities of a lossy bosonic channel with correlated noise. The model generalizes the one recently discussed in [Phys. Rev. A 77, 052324 (2008)], where memory effects come from the interaction with correlated…
This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief…
A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a…
We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…
The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucial role in this evolution. In 5G systems, rate-adaptive…
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-…
We present a unified one-shot coding framework designed for the communication and compression of messages among multiple nodes across a general acyclic noisy network. Our setting can be seen as a one-shot version of the acyclic discrete…
The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction…
Operator quantum error-correction is a technique for robustly storing quantum information in the presence of noise. It generalizes the standard theory of quantum error-correction, and provides a unified framework for topics such as quantum…
In this paper, we propose an iterative source error correction (ISEC) decoding scheme for deep-learning-based joint source-channel coding (Deep JSCC). Given a noisy codeword received through the channel, we use a Deep JSCC encoder and…
The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…
Recently, a purely quantum version of polar codes has been proposed in [1] based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as channel combining operation. Here, we…
Arikan has shown that systematic polar codes (SPC) outperform nonsystematic polar codes (NSPC). However, the performance gain comes at the price of elevated encoding complexity, i.e., compared to NSPC, the available encoding methods for SPC…
Cross-modal noise-robust learning is a challenging task since noisy correspondence is hard to recognize and rectify. Due to the cumulative and unavoidable negative impact of unresolved noise, existing methods cannot maintain a stable…
A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli…
Optimal coding over the additive white Gaussian noise channel under the peak energy constraint is studied when there is noisy feedback over an orthogonal additive white Gaussian noise channel. As shown by Pinsker, under the peak energy…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…