Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Kumar, P. Vijay"'
We consider the problem of geographically distributed data storage in a network of servers (or nodes) where the nodes are connected to each other via communication links having certain round-trip times (RTTs). Each node serves a specific set of clien
Externí odkaz:
http://arxiv.org/abs/2405.06641
Streaming codes are packet-level codes that recover dropped packets within a strict decoding-delay constraint. We study streaming codes over a sliding-window (SW) channel model which admits only those erasure patterns which allow either a single burs
Externí odkaz:
http://arxiv.org/abs/2405.06621
Autor:
Bhatnagar, Shobhit, Kumar, P. Vijay
Streaming codes (SCs) are packet-level codes that recover erased packets within a strict decoding-delay deadline. Streaming codes for various packet erasure channel models such as sliding-window (SW) channel models that admit random or burst erasures
Externí odkaz:
http://arxiv.org/abs/2405.06606
For a convolutional code in the presence of a symbol erasure channel, the information debt $I(t)$ at time $t$ provides a measure of the number of additional code symbols required to recover all message symbols up to time $t$. Information-debt-optimal
Externí odkaz:
http://arxiv.org/abs/2305.06303
In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packets to the destination via the relay. The three-node D&F relay network
Externí odkaz:
http://arxiv.org/abs/2207.04025
Streaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally
Externí odkaz:
http://arxiv.org/abs/2109.03168
Streaming codes are a class of packet-level erasure codes that ensure packet recovery over a sliding window channel which allows either a burst erasure of size $b$ or $a$ random erasures within any window of size $(\tau+1)$ time units, under a strict
Externí odkaz:
http://arxiv.org/abs/2105.04432
Streaming codes represent a packet-level FEC scheme for achieving reliable, low-latency communication. In the literature on streaming codes, the commonly-assumed Gilbert-Elliott channel model, is replaced by a more tractable, delay-constrained, slidi
Externí odkaz:
http://arxiv.org/abs/2104.07005
Autor:
Ramkumar, Vinayak, Vajha, Myna, Balaji, S. B., Krishnan, M. Nikhil, Sasidharan, Birenjith, Kumar, P. Vijay
This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliabi
Externí odkaz:
http://arxiv.org/abs/2010.01344
An $(a,b,\tau)$ streaming code is a packet-level erasure code that can recover under a strict delay constraint of $\tau$ time units, from either a burst of $b$ erasures or else of $a$ random erasures, occurring within a sliding window of time duratio
Externí odkaz:
http://arxiv.org/abs/2005.07113