Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Torleiv Kløve"'
Autor:
Torleiv Klove
There are two basic methods of error control for communication, both involving coding of the messages. With forward error correction, the codes are used to detect and correct errors. In a repeat request system, the codes are used to detect errors and
Autor:
Torleiv Kløve
Publikováno v:
Cryptography and Communications. 11:549-555
Linear codes of length 2 over the integers modulo some integer q that can correct single errors of limited size are considered. A code can be determined by a check pair of integers. For a given range of integers, − μ ≤ e ≤ λ, such a code can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff693c42d1219474a457724d0bd41e77
https://doi.org/10.1007/s12095-018-0327-0
https://doi.org/10.1007/s12095-018-0327-0
Autor:
Torleiv Kløve
Publikováno v:
IEEE Transactions on Information Theory. 62:1177-1182
Linear covering codes and covering sets for the limited-magnitude-error channel are studied. Two new general covering set constructions are given.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16470c5b36645e388c77a8dda1065601
https://doi.org/10.1109/tit.2016.2519406
https://doi.org/10.1109/tit.2016.2519406
Autor:
Torleiv Kløve
Publikováno v:
Arithmetic of Finite Fields ISBN: 9783030051525
WAIFI
WAIFI
Linear codes of length 2 over the integers modulo some integer q that can correct single errors of limited size are considered. A code can be determined by a check pair of integers. The errors e considered are in the range \(-\mu \le e \le \lambda \)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad80e2557c62d714d0f67477a541fdcd
https://doi.org/10.1007/978-3-030-05153-2_13
https://doi.org/10.1007/978-3-030-05153-2_13
Autor:
Torleiv Kløve
Publikováno v:
Cryptography and Communications. 8:415-433
The concepts of a linear covering code and a covering set for the limited-magnitude-error channel were introduced in KlOve and Schwartz (2013). Here, a number of new covering set constructions are given, in particular for sets of r-tuples of large r.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea8455e1dab22b2d19d80963274f39c1
https://doi.org/10.1007/s12095-015-0154-5
https://doi.org/10.1007/s12095-015-0154-5
Autor:
Moshe Schwartz, Torleiv Kløve
Publikováno v:
Designs, Codes and Cryptography. 73:329-354
The concepts of a linear covering code and a covering set for the limited-magnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::556dcafd7066fe5abaacb5086c1071d0
https://doi.org/10.1007/s10623-013-9917-1
https://doi.org/10.1007/s10623-013-9917-1
Publikováno v:
IEEE Transactions on Information Theory. 59:7278-7287
In multilevel flash memories, leakage of charges results in errors, and the errors are asymmetric, of increasing type and of limited magnitude. On the other hand, low data retention may result in asymmetric errors of decreasing type and usually of sm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cca285afffd03775d6c8733336cb00a
https://doi.org/10.1109/tit.2013.2279792
https://doi.org/10.1109/tit.2013.2279792
Autor:
Jinquan Luo, Torleiv Kløve
Publikováno v:
IEEE Transactions on Information Theory. 58:5512-5521
Upper bounds on the weight distribution function for codes of minimum distance at least 2 are given. Codes, where the bound is met with equality, are characterized. An improved upper bound on the weight distribution function for codes of minimum dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adcaeb4f390eff907a3c25e5759c3773
https://doi.org/10.1109/tit.2012.2197176
https://doi.org/10.1109/tit.2012.2197176
Publikováno v:
IEEE Transactions on Information Theory. 58:2206-2219
An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting a sing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f89a72615195afefa51bcf6447f2534
https://doi.org/10.1109/tit.2011.2179007
https://doi.org/10.1109/tit.2011.2179007
Publikováno v:
IEEE Transactions on Information Theory. 57:7459-7472
An error model with asymmetric errors of limited magnitude is a good model for some multilevel flash memories. This paper is about constructions of codes correcting such errors. The main results are about codes correcting a single such error and code
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69b76afc79393044147d360d87e160ca
https://doi.org/10.1109/tit.2011.2160839
https://doi.org/10.1109/tit.2011.2160839