scholarly journals Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring

2018 ◽  
Vol 504 ◽  
pp. 587-612 ◽  
Author(s):  
Umberto Martínez-Peñas
10.37236/6106 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Nicola Durante ◽  
Alessandro Siciliano

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 89128-89140 ◽  
Author(s):  
Arslan Khalid ◽  
Hafiz M. Asif ◽  
Shahid Mumtaz ◽  
Sattam Al Otaibi ◽  
Kostromitin Konstantin

2008 ◽  
Vol 54 (11) ◽  
pp. 4866-4886 ◽  
Author(s):  
Sanket Dusad ◽  
Suhas N. Diggavi ◽  
A. Robert Calderbank

2018 ◽  
Vol 50 ◽  
pp. 293-303 ◽  
Author(s):  
Kamil Otal ◽  
Ferruh Özbudak

2017 ◽  
Vol 86 (7) ◽  
pp. 1469-1481 ◽  
Author(s):  
Kai-Uwe Schmidt

2018 ◽  
Vol 49 (4) ◽  
pp. 507-534 ◽  
Author(s):  
Bence Csajbók ◽  
Alessandro Siciliano

Sign in / Sign up

Export Citation Format

Share Document