Related papers: Universal Polarization for Processes with Memory
We study a dephasing channel with memory, modelled by a Markov chain. We show that even weak memory effects have a detrimental impact on the performance of quantum error correcting schemes designed for uncorrelated errors. We also discuss…
This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding "guard bands" between segments. In the new scheme, each guard…
Here we present an experimentally feasible quantum memory for individual polarization photon with long-lived atomic ensembles excitations. Based a process similar to teleportation, the memory is reversible. And the storage information can…
Quantum entanglement of particles is regarded as a fundamental character in quantum information, in which quantum state should be given for whole system instead of independently describing single particle. Constructing quantum memory of…
Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data,…
It is shown that for any binary-input discrete memoryless channel $W$ with symmetric capacity $I(W)$ and any rate $R <I(W)$, the probability of block decoding error for polar coding under successive cancellation decoding satisfies $P_e \le…
Here we have proposed two decoding strategies of low-density parity-check (LDPC) codes over Markov noise channels with bit flipping noise. The sum-product algorithm used for decoding LDPC codes over memoryless channels is extended to…
We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with…
Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…
The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…
A single-letter characterization is provided for the capacity region of finite-state multiple-access channels, when the channel state process is an independent and identically distributed sequence, the transmitters have access to partial…
Energy-based probabilistic models learned by maximizing the likelihood of the data are limited by the intractability of the partition function. A widely used workaround is to maximize the pseudo-likelihood, which replaces the global…
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…
Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on the system state in general, with the…
Designing bounded-memory algorithms is becoming increasingly important nowadays. Previous works studying bounded-memory algorithms focused on proving impossibility results, while the design of bounded-memory algorithms was left relatively…
We examine the emergence of dynamical memory effects in quantum processes having indefinite time direction and causal order. In particular, we focus on the class of phase-covariant qubit channels, which encompasses some of the most…
We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propose a generalization of Csiszar and Korner's Maximum Mutual…
We introduce a method to distribute memory effects among different subspaces of an open two-qubit system's state space. Within the linear optical framework, our system of interest is the polarization of two photons, while the environment…
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…