Results 261 to 270 of about 3,739 (304)

Antagonistic histone post-translational modifications improve the fidelity of epigenetic inheritance - a Bayesian perspective. [PDF]

Epigenetics Chromatin
Prabhu BNB, Soni AN, Pillai SRB, Ramakrishnan N.   +3 more
europepmc   +1 more source

The Gaussian Erasure Channel

2007 IEEE International Symposium on Information Theory, 2007
This paper finds the capacity of linear time-invariant systems observed in additive Gaussian noise through a memoryless erasure channel. This problem requires obtaining the asymptotic spectral distribution of a submatrix of a nonnegative definite Toeplitz matrix obtained by retaining each column/row independently and with identical probability. We show
Antonia M. Tulino, Sergio Verdú, Giuseppe Caire, Shlomo Shamai   +3 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Turbo Codes in Binary Erasure Channel

IEEE Transactions on Information Theory, 2008
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are studied by using the stopping set analysis. It is found that block and bit erasure probabilities of turbo codes with iterative decoding are higher than those with maximum ...
Rüdiger Urbanke, Richard E Blahut
exaly   +2 more sources

Channel Combining for Nonstationary Polarization on Erasure Channels

2021 IEEE International Symposium on Information Theory (ISIT), 2021
The problem of channel polarization for an arbitrary sequence $\{W_{i}\}_{i=0}^{n-1}$ of $n$ independent channels, referred to as a nonstationary sequence of channels, is considered. Also, each of the channels is used only once for communication. We consider a general framework for polarization of non-stationary channels and aim at optimizing the ...
Hanwen Yao, Hessam Mahdavifar, Arman Fazeli, Alexander Vardy   +3 more
openaire   +1 more source

Capacity of the Erasure Shuffling Channel

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020
Motivated by DNA-based data storage, we study the erasure shuffling channel. This channel takes as input multiple strings, which are passed through an erasure channel and then shuffled out of order. We show that the capacity of this channel, for a large set of channel parameters, is given by the capacity of the binary erasure channel, C BEC , minus a ...
Seiyun Shin, Reinhard Heckel, Ilan Shomorony   +2 more
openaire   +1 more source

Erasure adversarial wiretap channels

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015
In an erasure adversarial wiretap channel (eAWTP-channel), the adversary can select a fraction ρr of the codeword to read, and a fraction ρe of the codeword to erase. The model can be seen as an extension of the wiretap II model where the adversary not only selects its view of the transmitted word, but also can erase a fraction of the codeword.
Pengwei Wang 0006, Reihaneh Safavi-Naini, Fuchun Lin   +2 more
openaire   +1 more source

Converting a q-ary Symmetric Channel into an Error-Erasure Channel with Erasure Marking

2021 9th International Electrical Engineering Congress (iEECON), 2021
The ability to mark erasure precisely is useful for data communications. The concept of error locating vector of Vector Symbol Decoding (VSD) has been used to mark error positions. This paper proposes the idea of converting none or some errors to erasures to reduce the decoding complexity. If the number of erroneous symbols input to VSD is limited to x,
Usana Tuntoolavest, Visuttha Manthamkarn, Pakorn Ditphakwaen   +2 more
openaire   +1 more source

Random Matrices and Codes for the Erasure Channel

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris Studholme, Ian F. Blake
openaire   +1 more source

Optimal correlating transform for erasure channels

IEEE Signal Processing Letters, 2005
In this letter, we derive a gradient-based algorithm for computing the optimal transform when coefficients are transmitted over an erasure channel whose statistics are known. The discrete transform introduces correlation among the coefficients with consequent performance improvement against losses.
ROMANO, Gianmarco, SALVO ROSSI, Pierluigi, PALMIERI, Francesco   +2 more
openaire   +2 more sources

Oversampled transforms for channels with erasures

Proceedings of the IEEE Information Theory Workshop, 2003
Oversampled transforms are used to provide robustness against erasures. Oversampled DFT codes have already been studied for erasure channels Me IP networks. We propose oversampled DCT transforms called DCT codes for erasure channels. We show that DCT codes offer more flexibility in design as compared to DFT codes and for some cases, lesser average mean
openaire   +1 more source