2 papers
cs.IT2010
Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
Dejan Spasov
We show that for (systematic) linear codes the time complexity of unique decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum distance decoding is O(n^{2}q^{nR…
cs.IT2009
Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate
Dejan Spasov, Marjan Gusev
We compute the code parameters for binary linear codes obtained by greedy constructing the parity check matrix. Then we show that these codes improve the Gilbert-Varshamov (GV) bou…