Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Improved bound on the error probability of fixed convolutional codes

Karin Engdahl, Dmitri V. Truhachev, Kamil Sh. Zigangirov

Published Jan 1, 2001• 0 citations
OpenAlex

Related papers

New Tight Bounds on Error Probabilities of Binary Convolutional Codes

Hung Nguyen Tung, Takeshi Hashimoto

IEEE International Symposium on Information Theory (ISIT)•Dec 15, 2003•0 citations

On the theory of list decoding of convolutional codes

Rolf Johannesson, Kamil Sh. Zigangirov

Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and nonsystematic encoders. >From these bounds it follows that the necessary list size grows exponentially with the number of corrected errors. We obtain an expurgated upper bound on the probability of the correct path loss for the ensemble of time-invariant binary convolutional codes. The notion of an l-list weight enumerator is introduced and used to obtain an upper bound on the probability of the correct path loss for list decoding of a fixed convolutional code.

Problems of Information Transmission•Jan 1, 1996•3 citations

On the Theory of Low-Density Convolutional Codes

Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov

Lecture notes in computer science•Jan 1, 1999•34 citations

Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm

Andrew J. Viterbi

The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channels the bounds are asymptotically (exponentially) tight for rates above R 0 , the computational cutoff rate of sequential decoding. As a function of constraint length the performance of optimal convolutional codes is shown to be superior to that of block codes of the same length, the relative improvement increasing with rate. The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R 0 and whose performance bears certain similarities to that of sequential decoding algorithms.

Co-Published with Indian Institute of Science (IISc), Bangalore, India eBooks•Sep 1, 2009•34 citations

A lower bound on the distance profile for convolutional codes

Rolf Johannesson, Kamil Sh. Zigangirov

•Jan 1, 1989•0 citations

On Distance Properties of Convolutional Polar Codes

Ruslan Morozov, Peter Trifonov

A lower bound on the minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of the generalized cosets of the codes generated by the bottom rows of the polarizing matrix. Moreover, a construction of convolutional polar subcodes is proposed, which provides improved performance under successive cancellation list decoding. For sufficiently large list size, the decoding complexity of convolutional polar subcodes appears to be lower compared with Arikan polar subcodes with the same performance. The error probability of successive cancellation list decoding of convolutional polar subcodes is lower than that of Arikan polar subcodes with the same list size.

arXiv:1901.06341•IEEE Transactions on Communications•Apr 4, 2019•9 citations
Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and nonsystematic encoders. >From these bounds it follows that the necessary list size grows exponentially with the number of corrected errors. We obtain an expurgated upper bound on the probability of the correct path loss for the ensemble of time-invariant binary convolutional codes. The notion of an l-list weight enumerator is introduced and used to obtain an upper bound on the probability of the correct path loss for list decoding of a fixed convolutional code.
The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channels the bounds are asymptotically (exponentially) tight for rates above R 0 , the computational cutoff rate of sequential decoding. As a function of constraint length the performance of optimal convolutional codes is shown to be superior to that of block codes of the same length, the relative improvement increasing with rate. The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R 0 and whose performance bears certain similarities to that of sequential decoding algorithms.
A lower bound on the minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of the generalized cosets of the codes generated by the bottom rows of the polarizing matrix. Moreover, a construction of convolutional polar subcodes is proposed, which provides improved performance under successive cancellation list decoding. For sufficiently large list size, the decoding complexity of convolutional polar subcodes appears to be lower compared with Arikan polar subcodes with the same performance. The error probability of successive cancellation list decoding of convolutional polar subcodes is lower than that of Arikan polar subcodes with the same list size.