Reflections about a single checksum

Authors:
Ulrich Tamm
Affiliations:
German Language Department of Business Informatics, Marmara University, Istanbul, Turkey
Venue:
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Year:
2010

Citing 5
Cited 0

On perfect t-shift codes in abelian groups

Designs, Codes and Cryptography
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes

IEEE Transactions on Computers
Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh

Information Processing Letters
Characterizing r-perfect codes in direct products of two and three cycles

Information Processing Letters
Splittings of cyclic groups and perfect shift codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 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.