nach oben

Designs, Codes and Cryptography

Erschienen in:

01.11.2014

Linear covering codes and error-correcting codes for limited-magnitude errors

verfasst von: Torleiv Kløve, Moshe Schwartz

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

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 involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcting codes are also considered for some small-magnitude errors.

Vorheriger Artikel On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences

Nächster Artikel PotLLL: a polynomial time version of LLL with deep insertions

Nur mit Berechtigung zugänglich

Andrews G.E.: Number Theory. W. B. Saunders Co., Philadelphia (1971).

Cassuto Y., Schwartz M., Bohossian V., Bruck J.: Codes for asymmetric limited-magnitude errors with applications to multilevel flash memories. IEEE Trans. Inf. Theory 56(4), 1582–1595 (2010).

Chen Z., Shparlinski I.E., Winterhof A.: Covering sets for limited-magnitude errors. arXiv:1310.0120v1 [cs.IT] 1 Oct 2013.

Hardy G.H., Wright E.M.: An Introduction to the Theory of Numbers, 4th edn. Oxford University Press, London (1960).

Jiang A., Langberg M., Schwartz M., Bruck J.: Trajectory codes for flash memory. IEEE Trans. Inf. Theory 59(7), 4530–4541 (2013).

Kløve T., Schwartz M.: Covering sets for limited-magnitude errors. In: Preproceedings, International Workshop on Coding and Cryptography (WCC), Bergen, 15–19 April 2013, pp. 69–78. http://www.selmer.uib.no/WCC2013/PreProceedings.

Kløve T., Bose B., Elarief N.: Systematic, single limited magnitude error correcting codes for flash memories. IEEE Trans. Inf. Theory 57(7), 4477–4487 (2011).

Kløve T., Luo J., Naydenova I., Yari S.: Some codes correcting asymmetric errors of limited magnitude. IEEE Trans. Inf. Theory 57(11), 7459–7472 (2011).

Kløve T., Luo J., Yari S.: Codes correcting single errors of limited magnitude. IEEE Trans. Inf. Theory 58(4), 2206–2219 (2012).

10.

Schwartz M.: Quasi-cross lattice tilings with applications to flash memory. IEEE Trans. Inf. Theory 58(4), 2397–2405 (2012).

11.

Schwartz M.: On the non-existence of lattice tilings by quasi-crosses. Eur. J. Comb. 36, 130–142 (2014).

12.

Stein S.K.: Tiling, packing, and covering by clusters. Rocky Mt. J. Math. 16, 277–321 (1986).

13.

Stein S.K., Szabó S.: Algebra and Tiling. The Mathematical Association of America, Washington, DC (1994).

14.

Szabó S.: Lattice covering by semicrosses of arm length 2. Eur. J. Comb. 12, 263–266 (1991).

15.

Yari S., Kløve T., Bose B.: Some codes correcting unbalanced errors of limited magnitude for flash memories. IEEE Trans. Inf. Theory 59(11), 7278–7287 (2013).

Titel: Linear covering codes and error-correcting codes for limited-magnitude errors
verfasst von: Torleiv Kløve
Moshe Schwartz
Publikationsdatum: 01.11.2014
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-013-9917-1

Springer Professional

Linear covering codes and error-correcting codes for limited-magnitude errors

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 2/2014

Improved algorithms for finding low-weight polynomial multiples in and some cryptographic applications

On transform-domain error and erasure correction by Gabidulin codes

A new large class of functions not APN infinitely often

More differentially 6-uniform power functions

Editorial: special issue on coding and cryptography

Generation of full cycles by a composition of NLFSRs

Premium Partner