On repeated-root cyclic codes

A parity-check matrix for a q-ary repeated-root cyclic code is derived using the Hasse derivative. Then the minimum distance of a q-ary repeated-root cyclic code is expressed in terms of the minimum distance of a certain simple-root cyclic code. With the help of this result, several binary repeated-...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 1991-03, Vol.37 (2), p.337-342
Hauptverfasser:	Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.
Format:	Artikel
Sprache:	eng
Schlagworte:	Block codes Error correction codes Galois fields H infinity control Helium Information processing Information theory Parity check codes Signal processing Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!