Results 251 to 260 of about 38,729 (264)
Some of the next articles are maybe not open access.
Nonlinear observation over erasure channel
49th IEEE Conference on Decision and Control (CDC), 2010In this paper, we study the problem of state observation of nonlinear systems over an erasure channel. Stochastic notions of stability are adopted from ergodic theory of random dynamical systems for the analysis. We use stability with probability one and mean square exponential stability to analyze the stability property of observer error dynamics. The
Amit Diwadkar, Umesh Vaidya
openaire +1 more source
Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel
2012 IEEE International Symposium on Information Theory Proceedings, 2012In this paper, the asymptotic iterative performance of block-Markov, sparse-graph codes over the binary erasure relay channel is investigated. Note that the full-duplex relay channel is a particular case of the considered model. We obtain two interesting results: a) the block-Markov structure does not improve the asymptotic performance of good erasure ...
Ivashkina, Marina +3 more
openaire +2 more sources
Capacity of the Erasure Shuffling Channel
ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020Motivated 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 +2 more
openaire +1 more source
Turbo Codes in Binary Erasure Channel
IEEE Transactions on Information Theory, 2008In 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 ...
Jeong W. Lee +2 more
openaire +1 more source
Multiple Description Coding over Erasure Channels
2008 IEEE International Conference on Communications, 2008In this paper, we study the optimal rate allocation of multiple description coding over multiple erasure channels in order to attain the minimum average distortion of the recovered message at the receiver. The results of this investigation are subsequently used to determine conditions under which the optimal rate allocation is characterized by ...
S. Zhao +3 more
openaire +1 more source
Information reconciliation for erasure channels
2017http://library.towson.edu/digital/collection/etd/id ...
openaire +1 more source
Polarization of Binary Erasure Channels
2018In this chapter, we will demonstrate the calculation of split channel capacities when polar codes are employed for binary erasure channels.
openaire +1 more source
The Noisy Channel Coding Theorem for Erasure Channels
The American Mathematical Monthly, 1974(1974). The Noisy Channel Coding Theorem for Erasure Channels. The American Mathematical Monthly: Vol. 81, No. 8, pp. 853-862.
openaire +1 more source
Coding in the Block-Erasure Channel
IEEE Transactions on Information Theory, 2006In this correspondence, we study an M-ary block-erasure channel with B blocks, where with probability epsi a block of L coded symbols is erased. The behavior of the error probability of coded systems over such channels is studied, and we show that, if the code is diversity-wise maximum-distance separable, its word error probability is equal to the ...
openaire +1 more source
Methods to Convert Error & Error-Erasure channel to Erasure Channel for Fountain Code Decoding
2022 International Electrical Engineering Congress (iEECON), 2022Visuttha Manthamkarn +3 more
openaire +1 more source