Paper Info
Title
Finding Good Linear Codes Using a Simple Extension Algorithm
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 .
Year
DOI
Venue
2011
10.1109/TIT.2011.2132114
IEEE Transactions on Information Theory
Keywords
Field
DocType
various method,linear codes,simple iterative algorithm,best known linear codes,coding theory,extendable codes,minimum distance,finding good linear,linear code,fixed parameter,good linear code,simple extension algorithm,iterative methods,generators,vectors
Hamming code,Discrete mathematics,Concatenated error correction code,Combinatorics,BCJR algorithm,Luby transform code,Computer science,Block code,Expander code,Algorithm,Reed–Muller code,Linear code
Journal
Volume
Issue
ISSN
57
10
0018-9448
Citations 
PageRank 
References 
1
0.37
8
Authors
1
Name
Order
Citations
PageRank
Sunghyu Han1356.52