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

IEEE International Symposium on Information Theory (ISIT)

New Tight Bounds on Error Probabilities of Binary Convolutional Codes

Hung Nguyen Tung, Takeshi Hashimoto

Published Dec 15, 2003• 0 citations
OpenAlex

Related papers

Improved bound on the error probability of fixed convolutional codes

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

•Jan 1, 2001•0 citations

Some algebraic and distance properties of convolutional codes.

James L. Massey

Upper and lower bounds for feedback decoding and definite decoding minimum distances of binary convolutional codes

•Jan 1, 1968•3 citations

On the asymptotic accuracy of the union bound

Alexander Barg

A new lower bound on the error probability of maximum likelihood decoding of a binary code on a binary symmetric channel was proved in Barg and McGregor (2004, cs.IT/0407011). It was observed in that paper that this bound leads to a new region of code rates in which the random coding exponent is asymptotically tight, giving a new region in which the reliability of the BSC is known exactly. The present paper explains the relation of these results to the union bound on the error probability.

arXiv:cs/0412111•Dec 24, 2004•3 citations

Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm

Andrew J. Viterbi

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

A New Upper Bound on the ML DecodingError Probability of Linear Binary Block Codes in AWGN Interference

Shahram Yousefi, Amir Keyvan Khandani

Performance evaluation of maximum-likelihood (ML) soft-decision-decoded binary block codes is usually carried out using bounding techniques. Many tight upper bounds on the error probability of binary codes are based on the so-called Gallager's first bounding technique (GFBT). The tangential sphere bound (TSB) of Poltyrev which has been believed for many years to offer the tightest bound developed for binary block codes is an example. Within the framework of the TSB and GFBT, we apply a new method referred to as the "added-hyper-plane" (AHP) technique, to the decomposition of the error probability. This results in a bound developed upon the application of two stages of the GFBT with two different Gallager regions culminating in a tightened upper bound beyond the TSB. The proposed bound is simple and only requires the spectrum of the binary code.

IEEE Transactions on Information Theory•Nov 30, 2004•45 citations

On the Theory of Low-Density Convolutional Codes

Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov

Lecture notes in computer science•Jan 1, 1999•35 citations
Performance evaluation of maximum-likelihood (ML) soft-decision-decoded binary block codes is usually carried out using bounding techniques. Many tight upper bounds on the error probability of binary codes are based on the so-called Gallager's first bounding technique (GFBT). The tangential sphere bound (TSB) of Poltyrev which has been believed for many years to offer the tightest bound developed for binary block codes is an example. Within the framework of the TSB and GFBT, we apply a new method referred to as the "added-hyper-plane" (AHP) technique, to the decomposition of the error probability. This results in a bound developed upon the application of two stages of the GFBT with two different Gallager regions culminating in a tightened upper bound beyond the TSB. The proposed bound is simple and only requires the spectrum of the binary code.