Zobrazeno 1 - 10
of 36
pro vyhledávání: '"MAHDAVIANI, KAVEH"'
Publikováno v:
20th USENIX Conference on File and Storage Technologies (FAST) 2022
High density Solid State Drives, such as QLC drives, offer increased storage capacity, but a magnitude lower Program and Erase (P/E) cycles, limiting their endurance and hence usability. We present the design and implementation of non-binary, Voltage
Externí odkaz:
http://arxiv.org/abs/2208.00772
We study the effects of introducing a feedback channel in the erasure source-broadcast problem for the case of three receivers. In our problem formulation, we wish to transmit a binary source to three users over the erasure broadcast channel when cau
Externí odkaz:
http://arxiv.org/abs/2105.00353
We study the expected accumulated reward for a discrete-time Markov reward model with absorbing states. The rewards are impulse rewards, where a reward $\rho_{ij}$ is accumulated when transitioning from state $i$ to state $j$. We derive an explicit,
Externí odkaz:
http://arxiv.org/abs/2105.00330
Publikováno v:
In Intelligent Systems with Applications September 2023 19
Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen storage node
Externí odkaz:
http://arxiv.org/abs/1711.02770
In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of
Externí odkaz:
http://arxiv.org/abs/1708.06012
In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed nodes. Effi
Externí odkaz:
http://arxiv.org/abs/1708.03402
Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of th
Externí odkaz:
http://arxiv.org/abs/1311.2123
We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.
Comment: This paper was accepted as a short paper and presented as a poster in the 2013 IEEE International Symposium on Network Coding (Ne
Comment: This paper was accepted as a short paper and presented as a poster in the 2013 IEEE International Symposium on Network Coding (Ne
Externí odkaz:
http://arxiv.org/abs/1309.4651
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the perform
Externí odkaz:
http://arxiv.org/abs/1110.2343