DocumentCode :
2001270
Title :
Lowest-density MDS codes over extension alphabets
Author :
Louidor, Erez ; Roth, Ron M.
Author_Institution :
Comput. Sci. Dept., Technion, Haifa, Israel
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
58
Abstract :
In this paper, we identify a range of parameters for which the codes Zp(p,r) are provably maximum distance separable (MDS). This paper presents a definition of the codes Zp(p,r) and then summarize our results using Fq to denote the finite field with q elements.
Keywords :
Hamming codes; linear codes; matrix algebra; parity check codes; MDS; linear code; low-density maximum distance separable; parity check matrix; Computer science; Galois fields; Hamming distance; Length measurement; Linear code; Parity check codes; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228072
Filename :
1228072
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2001270
بازگشت