10 citations · 19 across the 10 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2018
On Finding the Largest Minimum Distance of Locally Recoverable Codes
Majid Khabbazian
The (n, k, r)-Locally recoverable codes (LRC) studied in this work are (n, k) linear codes for which the value of each coordinate can be recovered by a linear combination of at mos…
cs.IT2017
On the Average Locality of Locally Repairable Codes
Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani
A linear block code with dimension , length , and minimum distance is called a locally repairable code (LRC) with locality if it can retrieve any coded symbol by at m…
cs.IT2016★ 1 cited
Optimal Locally Repairable Codes with Improved Update Complexity
Mehrtash Mehrabi, Mostafa Shahabinejad, Masoud Ardakani +1
For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repai…