Systematic maximum sum rank codes

Finite Fields and Their Applications ◽

10.1016/j.ffa.2020.101677 ◽

2020 ◽

Vol 65 ◽

pp. 101677 ◽

Author(s):

Paulo Almeida ◽

Umberto Martínez-Peñas ◽

Diego Napp

Keyword(s):

Download Full-text

Reducible Rank Codes and Applications to Cryptography

Information, Coding and Mathematics ◽

10.1007/978-1-4757-3585-7_8 ◽

2002 ◽

pp. 121-132 ◽

Author(s):

Ernst M. Gabidulin ◽

Alexei Ourivski ◽

Bassem Ammar ◽

Bahram Honary

Keyword(s):

Download Full-text

The new construction of rank codes

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. ◽

10.1109/isit.2005.1523717 ◽

2005 ◽

Author(s):

A. Kshevetskiy ◽

E. Gabidulin

Keyword(s):

New Construction ◽

Download Full-text

Biologically Inspired Feature Rank Codes for Hardware Friendly Gas Identification With the Array of Gas Sensors

IEEE Sensors Journal ◽

10.1109/jsen.2016.2571342 ◽

2016 ◽

Vol 16 (14) ◽

pp. 5776-5784 ◽

Author(s):

Muhammad Hassan ◽

Amine Bermak

Keyword(s):

Gas Sensors ◽

Biologically Inspired ◽

Gas Identification ◽

Download Full-text

Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2019.2924888 ◽

2019 ◽

Vol 65 (12) ◽

pp. 7790-7805 ◽

Author(s):

Umberto Martinez-Penas ◽

Frank R. Kschischang

Keyword(s):

Locally Repairable Codes

Download Full-text

Rank codes using weak self-orthogonal bases

2010 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering (SIBIRCON) ◽

10.1109/sibircon.2010.5555316 ◽

2010 ◽

Author(s):

Igor Y. Sysoev ◽

Ernst M. Gabidulin

Keyword(s):

Orthogonal Bases ◽

Download Full-text

Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) ◽

10.1109/allerton.2018.8635867 ◽

2018 ◽

Author(s):

Umberto Martinez-Penas ◽

Frank R. Kschischang

Keyword(s):

Locally Repairable Codes

Download Full-text

Constant-Rank Codes and Their Connection to Constant-Dimension Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2010.2048447 ◽

2010 ◽

Vol 56 (7) ◽

pp. 3207-3216 ◽

Author(s):

Maximilien Gadouleau ◽

Zhiyuan Yan

Keyword(s):

Constant Rank ◽

Constant Dimension ◽

Constant Dimension Codes ◽

Download Full-text

On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2016.2616127 ◽

2016 ◽

Vol 62 (12) ◽

pp. 7245-7252 ◽

Author(s):

Philippe Gaborit ◽

Gilles Zemor

Keyword(s):

Minimum Distance ◽

Download Full-text

Error and erasure correcting algorithms for rank codes

Designs Codes and Cryptography ◽

10.1007/s10623-008-9185-7 ◽

2008 ◽

Vol 49 (1-3) ◽

pp. 105-122 ◽

Author(s):

Ernst M. Gabidulin ◽

Nina I. Pilipchuk

Keyword(s):

Download Full-text

Fast decoding of rank-codes with rank errors and column erasures

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. ◽

10.1109/isit.2004.1365435 ◽

2004 ◽

Author(s):

G. Richter ◽

S. Plass

Keyword(s):

Fast Decoding ◽

Download Full-text