Mathematical analysis of algebraic sequential coding

MaRDI QIDQ1204659zbMATH OpenFDO

Authors Kamil S. Zigangirov

Publication date 18 March 1993

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

algebraic sequential decoding of convolutional codescomplexity

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Review text

In this paper the author treats the mathematical analysis of algebraic sequential decoding of convolutional codes. He shows that if \(q>2\) this method for a convolutional code over \(GF(q)\) gives some proceedings in the complexity of decoding as compared to classical sequential decoding and decoding of Viterbi. The probability theoretic theorems show well the benefit of the used decoding algorithm.

Recommendations

• scientific article; zbMATH DE number 820517
• scientific article; zbMATH DE number 4035733
• scientific article; zbMATH DE number 1284126
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Convolutional codes. An algebraic approach

Cited in

(4)

• scientific article; zbMATH DE number 4035733 (Why is no real title available?)
• scientific article; zbMATH DE number 820517 (Why is no real title available?)
• A coding-theoretical approach to analyzing sequential patterns of the sixty-four hexagrams in the \textit{I Ching}
• Codes in the sum-rank metric: fundamentals and applications

This page was built for publication: Mathematical analysis of algebraic sequential coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1204659)