Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · TU/e Research Portal (Eindhoven University of Technology) · 1997

Performance and complexity of decoding algorithms

K.J. Keuning, F.M.J. Willems, T.J. Tjalkens

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

APA 7

Keuning, K., Willems, F., & Tjalkens, T. (1997). Performance and complexity of decoding algorithms. TU/e Research Portal (Eindhoven University of Technology), 5–8.

MLA 9

Keuning, K.J., et al. “Performance and complexity of decoding algorithms.” TU/e Research Portal (Eindhoven University of Technology), 1997, pp. 5–8.

Chicago

Keuning, K.J., F.M.J. Willems, and T.J. Tjalkens. 1997. “Performance and complexity of decoding algorithms.” TU/e Research Portal (Eindhoven University of Technology): 5–8.

Harvard

Keuning, K., Willems, F. and Tjalkens, T. (1997) ‘Performance and complexity of decoding algorithms’, TU/e Research Portal (Eindhoven University of Technology), pp. 5–8.

BibTeX
@article{keuning1997performance,
  title = {{Performance and complexity of decoding algorithms}},
  author = {Keuning, K.J. and Willems, F.M.J. and Tjalkens, T.J.},
  journal = {TU/e Research Portal (Eindhoven University of Technology)},
  pages = {5--8},
  year = {1997}
}

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

Complexity and Decoding

Stanislav Bulygin, Ruud Pellikaan, Xin-Wen Wu · Cambridge University Press eBooks · 2017

Cited by 0