16 citations · 40 across the 11 of their papers we have counts for
11 papers
Improving the Reliability of Next Generation SSDs using WOM-v Codes
Shehbaz Jaffer, Kaveh Mahdaviani, Bianca Schroeder
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 usab…
Three-terminal Erasure Source-Broadcast with Feedback
Louis Tan, Kaveh Mahdaviani, Ashish Khisti Member
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 bi…
Two-terminal Erasure Source-Broadcast with Feedback
Louis Tan, Kaveh Mahdaviani, Ashish Khisti
We study the effects of introducing a feedback channel in the two-receiver erasure source-broadcast problem in which a binary equiprobable source is to be sent over an erasure broa…
Markov Rewards Processes with Impulse Rewards and Absorbing States
Louis Tan, Kaveh Mahdaviani, Ashish Khisti
We study the expected accumulated reward for a discrete-time Markov reward model with absorbing states. The rewards are impulse rewards, where a reward is accumulated when…
Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes
Kaveh Mahdaviani, Ashish Khisti, Soheil Mohajer
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…
Product Matrix Minimum Storage Regenerating Codes with Flexible Number of Helpers
Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti
In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regen…
Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair
Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti
In a distributed storage systems (DSS) with systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performi…
Linear-Complexity Overhead-Optimized Random Linear Network Codes
Kaveh Mahdaviani, Raman Yazdani, Masoud Ardakani
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…
Overhead-Optimized Gamma Network Codes
Kaveh Mahdaviani, Raman Yazdani, Masoud Ardakani
We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.
Annotated Raptor Codes
Kaveh Mahdaviani, Masoud Ardakani, Chintha Tellambura
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 inf…
Improving the Sphere-Packing Bound for Binary Codes over Memoryless Symmetric Channels
Kaveh Mahdaviani, Shervin Shahidi, Shima Haddadi +2
A lower bound on the minimum required code length of binary codes is obtained. The bound is obtained based on observing a close relation between the Ulam's liar game and channel co…