Rosenthal's Decoding Algorithm for Certain 1-Dimensional Convolutional Codes

The performance of Rosenthal's decoding algorithm is measured when it is applied to certain family of 1-dimensional MDS convolutional codes. It is shown that the performance of this algorithm depends on the algebraic structure of the convolutional code we are working with.

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 65; číslo 12; s. 7736 - 7741
Hlavní autori: Munoz Castaneda, Angel Luis, Munoz-Porras, Jose M., Plaza-Martin, Francisco J.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
algebraic decoding
Algebro-geometric codes
Algorithms
Block codes
Codes
Complexity theory
Controllability
Convolutional codes
Decoding
input/state/output realizations
maximum distance separable (MDS) codes
Parity check codes
ISSN:0018-9448, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The performance of Rosenthal's decoding algorithm is measured when it is applied to certain family of 1-dimensional MDS convolutional codes. It is shown that the performance of this algorithm depends on the algebraic structure of the convolutional code we are working with.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2019.2921370