Skip to main content
Top

2015 | OriginalPaper | Chapter

6. Further Applications

Authors : Harald Niederreiter, Arne Winterhof

Published in: Applied Number Theory

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Check-digit systems and error-correcting codes (see Chap. 3 for the latter) are birds of a feather, but it must be conceded that error-correcting codes are the more colorful birds. Just like error-correcting codes, check-digit systems help to eliminate errors in data, but their aims are more modest than those of error-correcting codes. In a check-digit system we extend an identification number, as for example a bank account number, by a control symbol primarily to detect any single error. A check-digit system can be formally defined over any finite abelian group.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
4.
go back to reference N. Alon, M.B. Nathanson, I. Ruzsa, The polynomial method and restricted sums of congruence classes. J. Number Theory 56, 404–417 (1996)MathSciNetCrossRefMATH N. Alon, M.B. Nathanson, I. Ruzsa, The polynomial method and restricted sums of congruence classes. J. Number Theory 56, 404–417 (1996)MathSciNetCrossRefMATH
11.
go back to reference D.J. Bernstein, J. Buchmann, E. Dahmen (eds.), Post-Quantum Cryptography (Springer, Berlin, 2009)MATH D.J. Bernstein, J. Buchmann, E. Dahmen (eds.), Post-Quantum Cryptography (Springer, Berlin, 2009)MATH
16.
go back to reference S.A. Burr (ed.), The Unreasonable Effectiveness of Number Theory. Proceedings of Symposia in Applied Mathematics, vol. 46 (American Mathematical Society, Providence, 1992) S.A. Burr (ed.), The Unreasonable Effectiveness of Number Theory. Proceedings of Symposia in Applied Mathematics, vol. 46 (American Mathematical Society, Providence, 1992)
18.
go back to reference C. Carlet, Boolean functions for cryptography and error correcting codes, in Boolean Models and Methods in Mathematics, Computer Science, and Engineering, ed. by Y. Crama, P.L. Hammer (Cambridge University Press, Cambridge, 2010), pp. 257–397CrossRef C. Carlet, Boolean functions for cryptography and error correcting codes, in Boolean Models and Methods in Mathematics, Computer Science, and Engineering, ed. by Y. Crama, P.L. Hammer (Cambridge University Press, Cambridge, 2010), pp. 257–397CrossRef
20.
go back to reference F. Castro, I. Rubio, Diagonal equations, in Handbook of Finite Fields, ed. by G.L. Mullen, D. Panario (CRC Press, Boca Raton, 2013), pp. 206–213 F. Castro, I. Rubio, Diagonal equations, in Handbook of Finite Fields, ed. by G.L. Mullen, D. Panario (CRC Press, Boca Raton, 2013), pp. 206–213
22.
go back to reference Z.X. Chen, I.E. Shparlinski, A. Winterhof, Covering sets for limited-magnitude errors. IEEE Trans. Inf. Theory 60, 5315–5321 (2014)MathSciNetCrossRef Z.X. Chen, I.E. Shparlinski, A. Winterhof, Covering sets for limited-magnitude errors. IEEE Trans. Inf. Theory 60, 5315–5321 (2014)MathSciNetCrossRef
23.
go back to reference B. Chor, C.E. Leiserson, R.L. Rivest, An application of number theory to the organization of raster-graphics memory, in Proceedings of 23rd Symposium on Foundations of Computer Science, Chicago, 1982 (IEEE Computer Society, Los Angeles, 1982), pp. 92–99 B. Chor, C.E. Leiserson, R.L. Rivest, An application of number theory to the organization of raster-graphics memory, in Proceedings of 23rd Symposium on Foundations of Computer Science, Chicago, 1982 (IEEE Computer Society, Los Angeles, 1982), pp. 92–99
24.
go back to reference B. Chor, C.E. Leiserson, R.L. Rivest, J.B. Shearer, An application of number theory to the organization of raster-graphics memory. J. Assoc. Comput. Mach. 33, 86–104 (1986)MathSciNetCrossRef B. Chor, C.E. Leiserson, R.L. Rivest, J.B. Shearer, An application of number theory to the organization of raster-graphics memory. J. Assoc. Comput. Mach. 33, 86–104 (1986)MathSciNetCrossRef
26.
go back to reference G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes (North-Holland, Amsterdam, 1997)MATH G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes (North-Holland, Amsterdam, 1997)MATH
32.
go back to reference T.W. Cusick, P. Stănică, Cryptographic Boolean Functions and Applications (Elsevier/Academic Press, Amsterdam, 2009) T.W. Cusick, P. Stănică, Cryptographic Boolean Functions and Applications (Elsevier/Academic Press, Amsterdam, 2009)
36.
go back to reference L. Devroye, Binary search trees based on Weyl and Lehmer sequences, in Monte Carlo and Quasi-Monte Carlo Methods 1996, ed. by H. Niederreiter, P. Hellekalek, G. Larcher, P. Zinterhof. Lecture Notes in Statistics, vol. 127 (Springer, New York, 1998), pp. 40–65 L. Devroye, Binary search trees based on Weyl and Lehmer sequences, in Monte Carlo and Quasi-Monte Carlo Methods 1996, ed. by H. Niederreiter, P. Hellekalek, G. Larcher, P. Zinterhof. Lecture Notes in Statistics, vol. 127 (Springer, New York, 1998), pp. 40–65
47.
52.
go back to reference A. Garcia, H. Stichtenoth (eds.), Topics in Geometry, Coding Theory and Cryptography (Springer, Dordrecht, 2007)MATH A. Garcia, H. Stichtenoth (eds.), Topics in Geometry, Coding Theory and Cryptography (Springer, Dordrecht, 2007)MATH
55.
56.
go back to reference M.J.E. Golay, Notes on digital coding. Proc. Inst. Radio Eng. 37, 657 (1949) M.J.E. Golay, Notes on digital coding. Proc. Inst. Radio Eng. 37, 657 (1949)
68.
go back to reference K.J. Horadam, Hadamard Matrices and Their Applications (Princeton University Press, Princeton, 2007)CrossRefMATH K.J. Horadam, Hadamard Matrices and Their Applications (Princeton University Press, Princeton, 2007)CrossRefMATH
76.
go back to reference A.Y. Khinchin, Three Pearls of Number Theory (Graylock Press, Rochester, 1952)MATH A.Y. Khinchin, Three Pearls of Number Theory (Graylock Press, Rochester, 1952)MATH
77.
go back to reference A. Kholosha, A. Pott, Bent and related functions, in Handbook of Finite Fields, ed. by G.L. Mullen, D. Panario (CRC Press, Boca Raton, 2013), pp. 262–273 A. Kholosha, A. Pott, Bent and related functions, in Handbook of Finite Fields, ed. by G.L. Mullen, D. Panario (CRC Press, Boca Raton, 2013), pp. 262–273
79.
go back to reference A. Klappenecker, M. Rötteler, Constructions of mutually unbiased bases, in Finite Fields and Applications, ed. by G.L. Mullen, A. Poli, H. Stichtenoth. Lecture Notes in Computer Science, vol. 2948 (Springer, Berlin, 2004), pp. 137–144 A. Klappenecker, M. Rötteler, Constructions of mutually unbiased bases, in Finite Fields and Applications, ed. by G.L. Mullen, A. Poli, H. Stichtenoth. Lecture Notes in Computer Science, vol. 2948 (Springer, Berlin, 2004), pp. 137–144
87.
89.
go back to reference J.M. Kubina, M.C. Wunderlich, Extending Waring’s conjecture to 471, 600, 000. Math. Comput. 55, 815–820 (1990) J.M. Kubina, M.C. Wunderlich, Extending Waring’s conjecture to 471, 600, 000. Math. Comput. 55, 815–820 (1990)
91.
go back to reference S. Kunoff, N! has the first digit property. Fibonacci Q. 25, 365–367 (1987) S. Kunoff, N! has the first digit property. Fibonacci Q. 25, 365–367 (1987)
93.
go back to reference C.F. Laywine, G.L. Mullen, Discrete Mathematics Using Latin Squares (Wiley, New York, 1998)MATH C.F. Laywine, G.L. Mullen, Discrete Mathematics Using Latin Squares (Wiley, New York, 1998)MATH
98.
101.
go back to reference R. Lidl, H. Niederreiter, Finite Fields (Addison-Wesley, Reading, 1983). Reprint, Cambridge University Press, Cambridge, 1997 R. Lidl, H. Niederreiter, Finite Fields (Addison-Wesley, Reading, 1983). Reprint, Cambridge University Press, Cambridge, 1997
117.
go back to reference G.L. Mullen, D. Panario (eds.), Handbook of Finite Fields (CRC Press, Boca Raton, 2013)MATH G.L. Mullen, D. Panario (eds.), Handbook of Finite Fields (CRC Press, Boca Raton, 2013)MATH
119.
go back to reference K. Nagasaka, J.-S. Shiue, Benford’s law for linear recurrence sequences. Tsukuba J. Math. 11, 341–351 (1987)MathSciNetMATH K. Nagasaka, J.-S. Shiue, Benford’s law for linear recurrence sequences. Tsukuba J. Math. 11, 341–351 (1987)MathSciNetMATH
120.
go back to reference M.B. Nathanson, Additive Number Theory, Volume 2: Inverse Problems and the Geometry of Sumsets. Graduate Texts in Mathematics, vol. 165 (Springer, New York, 1996) M.B. Nathanson, Additive Number Theory, Volume 2: Inverse Problems and the Geometry of Sumsets. Graduate Texts in Mathematics, vol. 165 (Springer, New York, 1996)
121.
go back to reference M.B. Nathanson (ed.), Unusual Applications of Number Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 64 (American Mathematical Society, Providence, 2004) M.B. Nathanson (ed.), Unusual Applications of Number Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 64 (American Mathematical Society, Providence, 2004)
139.
149.
go back to reference M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)MATH M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)MATH
151.
go back to reference I. Niven, H.S. Zuckerman, H.L. Montgomery, An Introduction to the Theory of Numbers, 5th edn. (Wiley, New York, 1991) I. Niven, H.S. Zuckerman, H.L. Montgomery, An Introduction to the Theory of Numbers, 5th edn. (Wiley, New York, 1991)
152.
go back to reference H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms (Springer, Berlin, 1981)CrossRefMATH H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms (Springer, Berlin, 1981)CrossRefMATH
154.
go back to reference O. Ore, Number Theory and Its History (McGraw-Hill, New York, 1948)MATH O. Ore, Number Theory and Its History (McGraw-Hill, New York, 1948)MATH
156.
go back to reference R.E.A.C. Paley, On orthogonal matrices. J. Math. Phys. 12, 311–320 (1933) R.E.A.C. Paley, On orthogonal matrices. J. Math. Phys. 12, 311–320 (1933)
159.
go back to reference J. Pieprzyk, T. Hardjono, J. Seberry, Fundamentals of Computer Security (Springer, Berlin, 2003)CrossRefMATH J. Pieprzyk, T. Hardjono, J. Seberry, Fundamentals of Computer Security (Springer, Berlin, 2003)CrossRefMATH
179.
go back to reference P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)MathSciNetCrossRefMATH P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)MathSciNetCrossRefMATH
181.
go back to reference I.E. Shparlinski, Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22 (Birkhäuser, Basel, 2003) I.E. Shparlinski, Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22 (Birkhäuser, Basel, 2003)
182.
183.
197.
go back to reference R.C. Vaughan, T.D. Wooley, Waring’s problem: a survey, in Number Theory for the Millennium, ed. by M.A. Bennett et al., vol. III (A.K. Peters, Natick, 2002), pp. 301–340 R.C. Vaughan, T.D. Wooley, Waring’s problem: a survey, in Number Theory for the Millennium, ed. by M.A. Bennett et al., vol. III (A.K. Peters, Natick, 2002), pp. 301–340
Metadata
Title
Further Applications
Authors
Harald Niederreiter
Arne Winterhof
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-22321-6_6

Premium Partner