Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct

We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Shankar, Priti, Kumar, P.N.A., Singh, Harmeet, Rajan, B.S.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Computer science control theory systems cyclic codes Exact sciences and technology Information retrieval. Graph Information, signal and communications theory linear block codes Reed-Solomon codes Signal and communications theory tail-biting trellises Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!