11 citations · 22 across the 22 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.IT2015★ 3 cited
Bounds on the Parameters of Locally Recoverable Codes
Itzhak Tamo, Alexander Barg, Alexey Frolov
A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recoverin…
cs.IT2015
An Upper Bound on the Minimum Distance of LDPC Codes over GF(q)
Alexey Frolov
In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generaliz…
cs.IT2015★ 1 cited
On the Multiple Threshold Decoding of LDPC codes over GF(q)
Alexey Frolov, Victor Zyablov
We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A low…