Publication:
Reflections about a single checksum

dc.contributor.authorsTamm U.
dc.date.accessioned2022-03-15T01:57:34Z
dc.date.accessioned2026-01-11T19:13:25Z
dc.date.available2022-03-15T01:57:34Z
dc.date.issued2010
dc.description.abstractA single checksum for codes consisting of n integer components is investigated. In coding theory this is mostly used for single error-correction in unconventional error models. If the errors are such that a single component ci is distorted to ci±ei, the analysis leads to equivalent group factorizations. We shall present several code constructions for this model, give a short survey on the coding theoretical and mathematical background, and also emphasize applications in cryptography and computer science. © 2010 Springer-Verlag Berlin Heidelberg.
dc.identifier.doi10.1007/978-3-642-13797-6_17
dc.identifier.isbn3642137962; 9783642137969
dc.identifier.issn3029743
dc.identifier.urihttps://hdl.handle.net/11424/246978
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectDistributed computing
dc.subjectGroup factorization
dc.subjectPerfect codes
dc.subjectSingle - error correction
dc.subjectSteganography
dc.titleReflections about a single checksum
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage249
oaire.citation.startPage238
oaire.citation.titleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
oaire.citation.volume6087 LNCS

Files