On the error exponent of convolutionally coded ARQ

DOI10.1109/18.312188MaRDI QIDQ4308805zbMATH OpenOpenAlexFDO

Authors 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

automatic repeat-request systemsconvolutional codesForney's exponentYamamoto-Itoh scheme

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

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

Cited in

(4)

• Extension of coefficients for (n, k, m) convolutional-code-based packet loss recovery
• A coded ARQ scheme with the generalized Viterbi algorithm
• Error probability for repeat request systems with convolutional codes
• Improved error exponent for time-invariant and periodically time-variant convolutional codes

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)