Critical lengths of error events in convolutional codes

DOI10.1109/18.681339zbMATH Open0936.94018OpenAlexW2106274814MaRDI QIDQ4701136FDOQ4701136

Jørn Justesen, Jakob Dahl Andersen

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/91a974e1-34c6-46e1-b705-ce721e8d2a8f

zbMATH Keywords

distancesconvolutional codescritical lengthexponentsburst lengthsderivation of error exponents

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (3)

• Increasing the output length of zero-error dispersers
• Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel
• Increasing the Output Length of Zero-Error Dispersers

   Recommendations

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm 👍 👎
• On the probability of error of convolutional codes 👍 👎
• Asymptotically catastrophic convolutional codes 👍 👎
• Error exponents for product convolutional codes 👍 👎
• Bounds on the probability of error for convolutional codes (Corresp.) 👍 👎

This page was built for publication: Critical lengths of error events in convolutional codes

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