About the Project

Stickelberger codes

AdvancedHelp

(0.001 seconds)

1—10 of 27 matching pages

1: 24.19 Methods of Computation
  • Buhler et al. (1992) uses the expansion

    24.19.3 t 2 cosh t 1 = 2 n = 0 ( 2 n 1 ) B 2 n t 2 n ( 2 n ) ! ,

    and computes inverses modulo p of the left-hand side. Multisectioning techniques are applied in implementations. See also Crandall (1996, pp. 116–120).

  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).

  • 2: 26.19 Mathematical Applications
    Partitions and plane partitions have applications to representation theory (Bressoud (1999), Macdonald (1995), and Sagan (2001)) and to special functions (Andrews et al. (1999) and Gasper and Rahman (2004)). Other areas of combinatorial analysis include graph theory, coding theory, and combinatorial designs. …
    3: 27.16 Cryptography
    Applications to cryptography rely on the disparity in computer time required to find large primes and to factor large integers. … For this reason, these are often called public key codes. Messages are coded by a method (described below) that requires only the knowledge of n . …For this reason, the codes are considered unbreakable, at least with the current state of knowledge on factoring large numbers. … To code a piece x , raise x to the power r and reduce x r modulo n to obtain an integer y (the coded form of x ) between 1 and n . …
    4: Viewing DLMF Interactive 3D Graphics
    Our WebGL code is based on the X3DOM framework which allows the building of the WebGL application around X3D, an XML based graphics code. …
    5: Bibliography S
  • K. Schulten and R. G. Gordon (1976) Recursive evaluation of 3 j - and 6 j - coefficients. Comput. Phys. Comm. 11 (2), pp. 269–278.
  • M. J. Seaton (1982) Coulomb functions analytic in the energy. Comput. Phys. Comm. 25 (1), pp. 87–95.
  • M. J. Seaton (2002b) FGH, a code for the calculation of Coulomb radial wave functions from series expansions. Comput. Phys. Comm. 146 (2), pp. 250–253.
  • M. J. Seaton (2002c) NUMER, a code for Numerov integrations of Coulomb functions. Comput. Phys. Comm. 146 (2), pp. 254–260.
  • J. Segura, P. Fernández de Córdoba, and Yu. L. Ratis (1997) A code to evaluate modified Bessel functions based on the continued fraction method. Comput. Phys. Comm. 105 (2-3), pp. 263–272.
  • 6: 18.38 Mathematical Applications
    Coding Theory
    For applications of Krawtchouk polynomials K n ( x ; p , N ) and q -Racah polynomials R n ( x ; α , β , γ , δ | q ) to coding theory see Bannai (1990, pp. 38–43), Leonard (1982), and Chihara (1987). …
    7: Bibliography T
  • T. Takemasa, T. Tamura, and H. H. Wolter (1979) Coulomb functions with complex angular momenta. Comput. Phys. Comm. 17 (4), pp. 351–355.
  • J. D. Talman (1983) LSFBTR: A subroutine for calculating spherical Bessel transforms. Comput. Phys. Comm. 30 (1), pp. 93–99.
  • T. Tamura (1970) Angular momentum coupling coefficients. Comput. Phys. Comm. 1 (5), pp. 337–342.
  • G. Taubmann (1992) Parabolic cylinder functions U ( n , x ) for natural n and positive x . Comput. Phys. Commun. 69, pp. 415–419.
  • I. J. Thompson (2004) Erratum to “COULCC: A continued-fraction algorithm for Coulomb functions of complex order with complex arguments”. Comput. Phys. Comm. 159 (3), pp. 241–242.
  • 8: Bibliography B
  • E. Bannai (1990) Orthogonal Polynomials in Coding Theory and Algebraic Combinatorics. In Orthogonal Polynomials (Columbus, OH, 1989), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Vol. 294, pp. 25–53.
  • A. R. Barnett (1981b) KLEIN: Coulomb functions for real λ and positive energy to high accuracy. Comput. Phys. Comm. 24 (2), pp. 141–159.
  • A. R. Barnett (1982) COULFG: Coulomb and Bessel functions and their derivatives, for real arguments, by Steed’s method. Comput. Phys. Comm. 27, pp. 147–166.
  • K. L. Bell and N. S. Scott (1980) Coulomb functions (negative energies). Comput. Phys. Comm. 20 (3), pp. 447–458.
  • K. H. Burrell (1974) Algorithm 484: Evaluation of the modified Bessel functions K0(Z) and K1(Z) for complex arguments. Comm. ACM 17 (9), pp. 524–526.
  • 9: Bibliography N
  • C. J. Noble and I. J. Thompson (1984) COULN, a program for evaluating negative energy Coulomb functions. Comput. Phys. Comm. 33 (4), pp. 413–419.
  • C. J. Noble (2004) Evaluation of negative energy Coulomb (Whittaker) functions. Comput. Phys. Comm. 159 (1), pp. 55–62.
  • Numerical Recipes (commercial C, C++, Fortran 77, and Fortran 90 libraries)
  • 10: Bibliography F
  • B. R. Fabijonas, D. W. Lozier, and J. M. Rappoport (2003) Algorithms and codes for the Macdonald function: Recent progress and comparisons. J. Comput. Appl. Math. 161 (1), pp. 179–192.
  • B. R. Fabijonas (2004) Algorithm 838: Airy functions. ACM Trans. Math. Software 30 (4), pp. 491–501.
  • D. F. Fang and J. F. Shriner (1992) A computer program for the calculation of angular-momentum coupling coefficients. Comput. Phys. Comm. 70 (1), pp. 147–153.
  • R. C. Forrey (1997) Computing the hypergeometric function. J. Comput. Phys. 137 (1), pp. 79–100.
  • F. N. Fritsch, R. E. Shafer, and W. P. Crowley (1973) Solution of the transcendental equation w e w = x . Comm. ACM 16 (2), pp. 123–124.