Construction of Independent Set and Its Application for Designed Minimum Distance

The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to construct the maximum value of the independent set. However, its computational complexity is very large. In this paper, we consider cyclic codes defined by...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE transactions on fundamentals of electronics, communications and computer sciences communications and computer sciences, 2012-01, Vol.E95.A (12), p.np-np
Hauptverfasser:	ZHENG, Junru, KAIDA, Takayasu
Format:	Artikel
Sprache:	jpn
Schlagworte:	Complexity Computation Construction Electronics Fourier transforms Lower bounds Mathematical analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!