A transform theory for a class of group-invariant codes

A binary cyclic code of length of n can be defined by a set of parity-check equations that is invariant under the additive cyclic group generated by A:i to i+1 modulo n. A class of quasicyclic codes that have parity-check equations invariant under the group generated by a subgroup of A and a subgrou...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 1988-07, Vol.34 (4), p.725-775
1. Verfasser:	Tanner, R.M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Decoding Electronic circuits Equations Error correction codes Feedback Fourier transforms Information theory Parity check codes Polynomials Shift registers
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!