Publication: Reflections about a Single Checksum
| dc.contributor.authors | Tamm, Ulrich | |
| dc.contributor.editor | Hasan, MA | |
| dc.contributor.editor | Helleseth, T | |
| dc.date.accessioned | 2022-03-12T16:01:36Z | |
| dc.date.accessioned | 2026-01-11T14:29:03Z | |
| dc.date.available | 2022-03-12T16:01:36Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | A 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 c(i) is distorted to c(i)+/-e(i), 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. | |
| dc.identifier.doi | doiWOS:000281987200017 | |
| dc.identifier.eissn | 1611-3349 | |
| dc.identifier.isbn | 978-3-642-13796-9 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | https://hdl.handle.net/11424/224879 | |
| dc.identifier.wos | WOS:000281987200017 | |
| dc.language.iso | eng | |
| dc.publisher | SPRINGER-VERLAG BERLIN | |
| dc.relation.ispartof | ARITHMETIC OF FINITE FIELDS, PROCEEDINGS | |
| dc.relation.ispartofseries | Lecture Notes in Computer Science | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | single - error correction | |
| dc.subject | perfect codes | |
| dc.subject | group factorization | |
| dc.subject | steganography | |
| dc.subject | distributed computing | |
| dc.subject | PERFECT CODES | |
| dc.subject | 3 CYCLES | |
| dc.subject | PACKING | |
| dc.subject | PRODUCTS | |
| dc.title | Reflections about a Single Checksum | |
| dc.type | conferenceObject | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 249 | |
| oaire.citation.startPage | 238 | |
| oaire.citation.title | ARITHMETIC OF FINITE FIELDS, PROCEEDINGS | |
| oaire.citation.volume | 6087 |