Results 271 to 280 of about 3,739 (304)

Coding in the Block-Erasure Channel

IEEE Transactions on Information Theory, 2006
In 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

On stability in the presence of analog erasure channels

2008 47th IEEE Conference on Decision and Control, 2008
Consider a discrete-time networked control scheme, in which the controller has direct access to noisy measurements of the plant?s output, but the controller and the actuator are connected via a link that features Bernoulli erasure events. We determine necessary and sufficient conditions for the stabilizability of an unstable linear and time-invariant ...
Vijay Gupta 0001, Nuno C. Martins
openaire   +1 more source

Capacity-achieving sequences for the erasure channel

IEEE Transactions on Information Theory, 2002
Summary: This paper starts a systematic study of capacity-achieving (c.a.) sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes.
Peter Oswald, Amin Shokrollahi 0001
openaire   +1 more source

On the Oblivious Transfer Capacity of the Erasure Channel

2006 IEEE International Symposium on Information Theory, 2006
One of the most important primitives in two-party distrustful cryptography is oblivious transfer, a complete primitive for two-party computation. Recently introduced, the oblivious transfer capacity of a noisy channel measures an efficiency of information theoretical reductions from 1-out-of-k, l-string oblivious transfer to noisy channels.
Hideki Imai, Kirill Morozov, Anderson C. A. Nascimento   +2 more
openaire   +1 more source

Algebraic-geometric codes on the erasure channel

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
This paper investigates the use of algebraic-geometric codes for data transmission over a packet network, by comparing their encoding/decoding speeds to those of the ubiquitous Reed-Solomon Codes. We take advantage of the fact that AG codes allow the construction of longer codes over a given alphabet, which in turn means we can create an [n, k]-code ...
Andrew Brown 0003, Amin Shokrollahi 0001
openaire   +1 more source

LT codes on partial erasure channels

2017 IEEE International Symposium on Information Theory (ISIT), 2017
LT codes are a class of rateless codes designed for data dissemination on erasure channels. In this paper, we present a decoder for LT codes on partial erasure channels, which were recently introduced for multi-level read storage channel applications. We compare the efficiency of LT codes on these channels to those on the q-ary Erasure Channel (QEC).
Carolyn Mayer, Christine A. Kelley
openaire   +1 more source

Nonlinear observation over erasure channel

49th IEEE Conference on Decision and Control (CDC), 2010
In 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

Random access channel assignment on a collision erasure channel

2020 Information Theory and Applications Workshop (ITA), 2020
Channel assignment for wireless radios employing random access is found in several contexts, including low-power wide area network (LPWAN) protocols such as LoRaWAN. This paper considers the assignment of a set of N radios to M available channels with the objective of maximizing the sum throughput.
Abhinanda Dutta, Steven Weber 0001
openaire   +1 more source

Erasure decoding in burst-error channels

IEEE Transactions on Information Theory, 1981
Burst-error channels have been used to model a large class of modern communication media, and the problem of communicating reliably through such media has received much study [1]-[9]. Existing techniques include two-way communication schemes that involve error detection and retransmission, and schemes that utilize error correcting codes in code ...
Kon S. Leung, Lloyd R. Welch
openaire   +1 more source

On the capacity of the erasure multiple relay channel

2009 IEEE Information Theory Workshop on Networking and Information Theory, 2009
This paper considers a simple wireless network - the multiple relay channel (MRC) - wherein a single source communicates with a single destination with the aid of M parallel relays. The links between the communicating nodes are non-interfering and subject to erasures. The capacity of this network is derived under the assumption that the destination has
Srinath Puducheri, Thomas E. Fuja
openaire   +1 more source