scholarly journals List-decoding of subspace codes and rank-metric codes up to Singleton bound

Author(s):  
Hessam Mahdavifar ◽  
Alexander Vardy
2016 ◽  
Vol 16 (07) ◽  
pp. 1750131 ◽  
Author(s):  
Elisa Gorla ◽  
Alberto Ravagnani

In this paper, we survey the main known constructions of Ferrers diagram rank-metric codes, and establish new results on a related conjecture by Etzion and Silberstein. We also give a sharp lower bound on the dimension of linear rank-metric anticodes with a given profile. Combining our results with the multilevel construction, we produce examples of subspace codes with the largest known cardinality for the given parameters. We also apply results from algebraic geometry to the study of the analogous problem over an algebraically closed field, proving that the bound by Etzion and Silberstein can be improved in this case, and providing a sharp bound for full-rank matrices.


Author(s):  
Vladimir Sidorenko ◽  
Wenhui Li ◽  
Gerhard Kramer

2019 ◽  
Vol 12 (05) ◽  
pp. 1950069
Author(s):  
Mahdieh Hakimi Poroch

In this paper, we propose the Sphere-packing bound, Singleton bound and Gilbert–Varshamov bound on the subspace codes [Formula: see text] based on totally isotropic subspaces in symplectic space [Formula: see text] and on the subspace codes [Formula: see text] based on totally isotropic subspace in extended symplectic space [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document