Results 241 to 250 of about 38,729 (264)
Constrained coding for error mitigation in nanopore-based DNA data storage. [PDF]
Sci RepWhritenour K, Civelek M, Farnoud F.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Erasure communication channel statistics
IEEE Proceedings on Southeastcon, 2002Three categories of density functions are demonstrated for an erasure communication channel where the output is restricted to being greater than some threshold. The exponential, gamma, and geometric variables are in the first category by a variance that goes to a constant value as the threshold goes to infinity.
J.J. Komo, R.W. Snelsire
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), 2021The 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 +2 more
openaire +1 more source
Erasure adversarial wiretap channels
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015In 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 +2 more
openaire +1 more source
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
TULINO, ANTONIA MARIA +3 more
openaire +2 more sources
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
TULINO, ANTONIA MARIA +3 more
openaire +2 more sources
Channel Combining for Nonstationary Polarization on Erasure Channels
2021 IEEE International Symposium on Information Theory (ISIT), 2021The 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 +3 more
openaire +1 more source
Optimal correlating transform for erasure channels
IEEE Signal Processing Letters, 2005In 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 +2 more
openaire +2 more sources
Secure Joint Cache-Channel Coding over Erasure Broadcast Channels
2017 IEEE Wireless Communications and Networking Conference (WCNC), 2017We derive upper and lower bounds on the secure capacity-memory tradeoff of the two-user wiretap erasure BC with cache memory at the weaker receiver. The bounds coincide when the cache memory exceeds a given threshold. The lower bound also exhibits that cache memories provide larger gains under a secrecy constraint than without such a constraint ...
Kamel, S., Sarkiss, M., Wigger, M.
openaire +1 more source