Title of article
Linear Recursive MDS-Codes and Asturian codes
Author/Authors
Couselo، نويسنده , , Elena and Gonzalez، نويسنده , , Santos and Markov، نويسنده , , Victor and Nechaev، نويسنده , , Alexandr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
8
From page
140
To page
147
Abstract
Let q = pt, where p is a prime. Then for any natural m, except the case m = 3 and q ≥ 8 is even, there exists a linear over the space Zpt m-dimensional recursive MDS-code of length q + 1 (q + 2 if q = m + 1 is even) which (in according to well-known conjecture of Bush, Blokhuis, Bruen & Thas) is believed to be the maximum of lengths of linear over the field GF(q) m-dimensional MDS-codes.
Keywords
linear recursive codes , MDS-codes , Reed-Solomon codes , codes over linear spaces
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452993
Link To Document