Skip to main content
Conference Proceedings

Codes of length 2 correcting single errors of limited size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9496 190-201
DOI: 10.1007/978-3-319-27239-9_12
3Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Linear codes over ℤq of length 2, correcting single errors of size at most k, are considered. It is determined for which q such codes exists and explicit code constructions are given for those q. One case remains open, namely q = (k + 1)(k + 2), where k + 1 is a prime power. For this case we conjecture that no such codes exist.

Author supplied keywords

Cite

CITATION STYLE

APA

Kløve, T. (2015). Codes of length 2 correcting single errors of limited size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9496, pp. 190–201). Springer Verlag. https://doi.org/10.1007/978-3-319-27239-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free