DocumentCode :
935914
Title :
A note on maximum distance separable (optimal) codes (Corresp.)
Author :
Vermani, L.R. ; Jindal, S.L.
Volume :
29
Issue :
1
fYear :
1983
fDate :
1/1/1983 12:00:00 AM
Firstpage :
136
Lastpage :
137
Abstract :
Given a positive integer 
and a prime power 
with 
, it is proved that the largest value of 
for which there exists an ![[n,k,n-k+l]](/images/tex/5712.gif)
maximum distance separable (MDS) code over GF 
is 
. A simple proof for the largest value of for which there exists an ![[n,2,n-1]](/images/tex/5713.gif)
MDS code over any finite field is also given.
and a prime power with , it is proved that the largest value of for which there exists an maximum distance separable (MDS) code over GF is . A simple proof for the largest value of for which there exists an MDS code over any finite field is also given.Keywords :
Coding/decoding; Galois fields; Error correction codes; Error probability; Galois fields; Performance analysis; Telecommunications; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056616
Filename :
1056616
Link To Document :
