Finding Good Linear Codes Using a Simple Extension Algorithm

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2011-10, Vol.57 (10), p.6729-6733
1. Verfasser:	HAN, Sunghyu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Best known linear codes coding theory Coding, codes Educational institutions Equations Exact sciences and technology extendable codes Generators Information theory Information, signal and communications theory Iterative methods Linear code Linear codes Parity check codes Signal and communications theory Telecommunications and information theory Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 .
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2011.2132114