Skip to main content
SpringerLink
Log in

Reflections about a Single Checksum

  • Conference paper
Arithmetic of Finite Fields (WAIFI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6087))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belitskaja, E.E., Sidorenko, V.R., Stenström, P.: Testing of Memory with Defects of Fixed Configurations. In: Proceedings of 2nd International Workshop on Algebraic and Combinatorial Coding Theory, Leningrad, pp. 24–28 (1990)

    Google Scholar 

  2. Biggs, N.: Perfect Codes in Graphs. J. Combin. Theory Ser. B 15, 289–296 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, H., Tzeng, N.: Efficient Resource Placement in Hypercubes Using Multiple–Adjacency Code. IEEE Trans. Comput. 43, 23–33 (1994)

    Article  MathSciNet  Google Scholar 

  4. Constantin, S.D., Rao, T.R.N.: On the Theory of Binary Asymmetric Error Correcting Codes. Information and Control 40, 20–26 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dorbec, P., Mollard, M.: Perfect Codes in Cartesian Products of 2–Paths and Infinite Paths. The Electronic Journal of Combinatorics 12, R65 (2005)

    MathSciNet  Google Scholar 

  6. Everett, H., Hickerson, D.: Packing and Covering by Translates of Certain Nonconvex Bodies. Proceedings of the American Mathematical Society 75 (1), 87–91 (1979)

    Google Scholar 

  7. Golomb, S.: A General Formulation of Error Metrics. IEEE Trans. Inform. Theory 15, 425–426 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  8. Golomb, S.: Polyominoes, 2nd edn. Princeton University Press, Princeton (1994)

    MATH  Google Scholar 

  9. Golomb, S., Welch, L.R.: Algebraic Coding and the Lee Metric. In: Mann, H.B. (ed.) Error Correcting Codes, pp. 175–194 (1968)

    Google Scholar 

  10. Graham, R.L., Sloane, N.J.A.: On Additive Bases and Harmonious Graphs. SIAM J. Algebr. Discr. Math. 1, 382–404 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hamaker, W., Stein, S.: Combinatorial Packing of R 3 by Certain Error Spheres. IEEE Trans. Inform. Theory 30, 364–368 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hickerson, D., Stein, S.: Abelian Groups and Packing by Semicrosses. Pacific J. Math. 122, 95–109 (1986)

    MATH  MathSciNet  Google Scholar 

  13. Horak, P.: On Perfect Lee Codes. Discrete Math. 309, 5551–5561 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jerebic, J., Klavžar, S., Špacapan, S.: Characterizing r-Perfect Codes in Direct Products of Two and Three Cycles. Inform. Process. Lett. 94, 1–6 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jha, P.K.: Perfect r-Domination in the Kronecker Product of Three Cycles. IEEE Trans. Circuit Systems – I: Fundamental Theory Appl. 49, 89–92 (2002)

    Article  MathSciNet  Google Scholar 

  16. Jha, P.K.: Perfect r-Domination in the Kronecker product of Two Cycles with an Application to Diagonal Toroidal Mesh. Inform. Process. Lett. 87, 163–168 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kostadinov, H., Manev, N., Morita, H.: Double ±1 Error - Correctable Codes and Their Applications to Modulation Schemes. In: Proceedings 11th Int. Workshop Algebraic and Combinatorial Coding Theory, Pamporovo, Bulgaria, pp. 155–160 (2008)

    Google Scholar 

  18. Levenshtein, V.I.: Binary Codes with Correction for Deletions and Insertions of the Symbol 1 (in Russian). Problemy Peredachi Informacii 1, 12–25 (1965)

    Google Scholar 

  19. Levenshtein, V.I., Vinck, A.J.H.: Perfect (d,k)–Codes Capable of Correcting Single Peak Shifts. IEEE Trans. Inform. Theory 39, 656–662 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lisonek, P.: Sum Covers in Steganography. In: Proceedings 11th Int. Workshop Algebraic and Combinatorial Coding Theory, Pamporovo, Bulgaria, pp. 186–191 (2008)

    Google Scholar 

  21. Livingston, M., Stout, Q.F.: Perfect Dominating Sets. Congr. Numer. 79, 187–203 (1990)

    MATH  MathSciNet  Google Scholar 

  22. Martirosyan, S.: Single – Error Correcting Close Packed and Perfect Codes. In: Proceedings 1st INTAS International Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia, pp. 90–115 (1996)

    Google Scholar 

  23. Morita, H., Geyser, A., van Wijngaarden, A.J.: On Integer Codes Capable of Correcting Single Errors in Two–Dimensional Lattices. In: Proceedings IEEE Int. Symp. Inform. Theory, Yokohama, p. 16 (2003)

    Google Scholar 

  24. Munemasa, A.: On Perfect t–Shift Codes in Abelian Groups. Designs, Codes, and Cryptography 5, 253–259 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  25. Qu, M., Vanstone, S.A.: Factorizations of Elementary Abelian p-Groups and their Cryptographic Significance. J. Cryptology 7, 201–212 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  26. Sands, A.D., Szabo, S.: Factoring Groups into Subsets. CRC Press, Boca Raton (2009)

    MATH  Google Scholar 

  27. Sidorenko, V.: Tilings of the Plane and Codes for Translational Metrics. In: Proceedings IEEE Int. Symp. Inform. Theory, Trondheim, p. 107 (1994)

    Google Scholar 

  28. Sloane, N.J.A.: On Single Deletion–Correcting Codes. In: Arasu, K.T., Seress, A. (eds.) Codes and Designs (Ray–Chaudhuri Festschrift), pp. 490–499. de Gruyter, Berlin (2002)

    Google Scholar 

  29. Stein, S.: Packing of R n by Certain Error Spheres. IEEE Trans. Inform. Theory 30, 356–363 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  30. Stein, S.: Tiling, Packing, and Covering by Clusters. Rocky Mountain J. Math. 16, 277–321 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  31. Stein, S.: Splitting Groups of Prime Order. Aequationes Mathematicae 33, 62–71 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  32. Stein, S.: Packing Tripods: Math. Intelligencer 17(2), 37–39 (1995)

    Article  MATH  Google Scholar 

  33. Stein, S., Szabó, S.: Algebra and Tiling, The Carus Mathematical Monographs, vol. 25. The Mathematical Association of America (1994)

    Google Scholar 

  34. Szabó, S.: Topics in Factorization of Abelian Groups. Birkhäuser, Basel (2004)

    Google Scholar 

  35. Tamm, U.: Splittings of Cyclic Groups and Perfect Shift Codes. IEEE Trans. Inform. Theory 44, 2003–2009 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  36. Tamm, U.: On Perfect Integer Codes. In: Proceedings IEEE Int. Symp. Inform. Theory, Adelaide, Australia (2005)

    Google Scholar 

  37. Varshamov, R.R., Tenengolts, G.M.: One Asymmetric Error Correcting Codes (in Russian). Avtomatika i Telemechanika 26, 288–292 (1965)

    Google Scholar 

  38. Vinck, A.J.H., Morita, H.: Codes over the Ring of Integers Modulo m. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E81–A (10), 2013–2018 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. German Language Department of Business Informatics, Marmara University, Istanbul, Turkey

    Ulrich Tamm

Authors
  1. Ulrich Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    M. Anwar Hasan

  2. Department of Informatics, HIB, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamm, U. (2010). Reflections about a Single Checksum. In: Hasan, M.A., Helleseth, T. (eds) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol 6087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13797-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13797-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13796-9

  • Online ISBN: 978-3-642-13797-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation