DocumentCode :
1340068
Title :
Finding Good Linear Codes Using a Simple Extension Algorithm
Author :
Han, Sunghyu
Author_Institution :
Sch. of Liberal Arts, Korea Univ. of Technol. & Educ., Cheonan, South Korea
Volume :
57
Issue :
10
fYear :
2011
Firstpage :
6729
Lastpage :
6733
Abstract :
Recently, there were several papers on finding good linear codes. Various methods were introduced to make good linear codes. In this paper, we give a simple iterative algorithm to make good linear codes. Using our algorithm we construct 86 codes which improve the minimum distance of previously best known linear codes for fixed parameters n, k .
Keywords :
iterative methods; linear codes; fixed parameter; linear code; simple extension algorithm; simple iterative algorithm; Educational institutions; Equations; Generators; Linear code; Parity check codes; Vectors; Best known linear codes; coding theory; extendable codes; linear codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2011.2132114
Filename :
6034718
Link To Document :
بازگشت