Skip to content
Free planNo credit card requiredStart writing

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

APA 7

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

MLA 9

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.

Chicago

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.

Harvard

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.

BibTeX
@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.