On the error exponent of convolutionally coded ARQ

DOI10.1109/18.312188zbMATH Open0805.94018OpenAlexW2059512082MaRDI QIDQ4308805

Takeshi Hashimoto

Publication date: 5 February 1995

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

Full work available at URL: https://doi.org/10.1109/18.312188

zbMATH Keywords

convolutional codesautomatic repeat-request systemsForney's exponentYamamoto-Itoh scheme

Mathematics Subject Classification ID

Decoding (94B35) Convolutional codes (94B10)

Related Items (2)

Extension of coefficients for (\(n, k, m\)) convolutional-code-based packet loss recovery ⋮ Improved error exponent for time-invariant and periodically time-variant convolutional codes

Recommendations

• Error exponents for product convolutional codes 👍 👎
• Asymptotic bit error probability for convolutional codes 👍 👎
• On upper bounds for the decoding error probability of convolutional codes 👍 👎
• Exponential error bounds for random codes in the arbitrarily varying channel 👍 👎
• On the Error Exponent of Trellis Source Coding 👍 👎
• Bounds on the probability of error for convolutional codes (Corresp.) 👍 👎
• On error exponents for arbitrarily varying channels 👍 👎
• On the probability of error of convolutional codes 👍 👎
• On Error Exponents of Encoder-Assisted Communication Systems 👍 👎
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm 👍 👎

This page was built for publication: On the error exponent of convolutionally coded ARQ

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