Skip to content
Free planNo credit card requiredStart writing

article · 2003

Error-correction capability of binary linear codes

T. Helleseth, T. Klove, V.I. Levenshtein

Cited by 1Abstract and details only

Abstract

In this paper, the error-correction capability of binary linear codes and the discrete simplex problem is discussed.

Cite this paper

APA 7

Helleseth, T., Klove, T., & Levenshtein, V. (2003). Error-correction capability of binary linear codes. https://doi.org/10.1109/isit.2003.1228480

MLA 9

Helleseth, T., et al. “Error-correction capability of binary linear codes.” 2003, p. 463, https://doi.org/10.1109/isit.2003.1228480.

Chicago

Helleseth, T., T. Klove, and V.I. Levenshtein. 2003. “Error-correction capability of binary linear codes.” https://doi.org/10.1109/isit.2003.1228480.

Harvard

Helleseth, T., Klove, T. and Levenshtein, V. (2003) ‘Error-correction capability of binary linear codes’. Available at: https://doi.org/10.1109/isit.2003.1228480.

BibTeX
@article{helleseth2003error,
  title = {{Error-correction capability of binary linear codes}},
  author = {Helleseth, T. and Klove, T. and Levenshtein, V.I.},
  pages = {463},
  year = {2003},
  doi = {10.1109/isit.2003.1228480}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Linear Block Codes

W.E. Ryan, Shu Lin · Cambridge University Press eBooks · 2009

Cited by 0