article · Lund University Publications (Lund University) · 2002
An upper bound on decoding bit-error probability with linear coding on extremely noisy channels
M. Handlery, Rolf Johannesson, James L. Massey, P. Ståhl
Cited by 1Open access
Abstract
When concatenated coding schemes operate near channel capacity their component encoders may operate above capacity. The decoding bit-error performance of binary convolutional codes near and above capacity is investigated.
Cite this paper
Handlery, M., Johannesson, R., Massey, J. L., & Ståhl, P. (2002). An upper bound on decoding bit-error probability with linear coding on extremely noisy channels. Lund University Publications (Lund University), 131. https://doi.org/10.1109/isit.2001.935994
Handlery, M., et al. “An upper bound on decoding bit-error probability with linear coding on extremely noisy channels.” Lund University Publications (Lund University), 2002, p. 131, https://doi.org/10.1109/isit.2001.935994.
Handlery, M., Rolf Johannesson, James L. Massey, and P. Ståhl. 2002. “An upper bound on decoding bit-error probability with linear coding on extremely noisy channels.” Lund University Publications (Lund University): 131. https://doi.org/10.1109/isit.2001.935994.
Handlery, M. et al. (2002) ‘An upper bound on decoding bit-error probability with linear coding on extremely noisy channels’, Lund University Publications (Lund University), p. 131. Available at: https://doi.org/10.1109/isit.2001.935994.
@article{handlery2002upper,
title = {{An upper bound on decoding bit-error probability with linear coding on extremely noisy channels}},
author = {Handlery, M. and Johannesson, Rolf and Massey, James L. and Ståhl, P.},
journal = {Lund University Publications (Lund University)},
pages = {131},
year = {2002},
doi = {10.1109/isit.2001.935994}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Deficient decoding for convolutional codes
Takeshi Hashimoto, Suguru Arimotos · Electronics and Communications in Japan (Part I Communications) · 1980
Cited by 1
Hyperimposed convolutional codes
J.-F. Cheng · International Conference on Communications · 2002
Cited by 10
Decoding of woven convolutional codes and simulation results
Ralph Jordan, Walter Schnug, Martin Bossert et al. · IEEE International Symposium on Information Theory (ISIT) · 2002
Cited by 0Open access
An Algebraic Decoding Algorithm for Convolutional Codes
Joachim Rosenthal · Birkhäuser Basel eBooks · 1999
Cited by 25Open access
A repeat request strategy based on sliding window decoding of unit-memory convolutional codes
Jürgen Freudenberger, Sergo Shavgulidze · IEEE Transactions on Information Theory · 2006
Cited by 1
The probability of error performance of Reed-Solomon codes over q-ary nonsymmetric channels
H.A. Rajab, M.D. Yucel · IEEE Mediterranean Electrotechnical Conference (MELECON) · 2002
Cited by 2Open access
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel
Yujie Gu, Ofer Shayevitz · IEEE International Symposium on Information Theory (ISIT) · 2019
Cited by 2
On the universality of Burnashev's error exponent
Aslan Tchamkerten, I. Emre Telatar · IEEE International Symposium on Information Theory (ISIT) · 2005
Cited by 0Open access