Finite fields, coding theory, and advances in communications and computing

Keywords

Coding theory, Coding (social sciences), Computer science, Information theory, Communication theory

References

No references recorded for this paper.

Cited by

• A Generic Construction for Intrusion-Resilient Signatures from Linear Feedback Shift RegisterZheng Gong, Xiangxue Li, Dong Zheng — 2008
• Research Article On Polynomials of the Form x r f(x (q−1)/l )Amir Akbary, Qiang Wang — 2007
• A decade of Finite Fields and Their ApplicationsGary L. Mullen — 2005
• The period lengths of inversive congruential recursionsWun-Seng Chou — 1995
• LFSR-based Signatures with Message RecoveryXiangxue Li, Dong Zheng, Kefei Chen — 2007
• The Number of Permutation Binomials over F4p+1 where p and 4p+1 are PrimesArata MASUDA, Daniel Panario, Qiang Wang — 2006
• A note on BIB designs with nested rows and columnsJames A. MacDougall, Gary L. Mullen — 1999
• Resolution of singularities and modular Galois theoryShreeram S. Abhyankar — 2000
• A class of permutation polynomials of F2m related to Dickson polynomialsHenk D. L. Hollmann, Qing Xiang — 2004
• Equidistribution Properties of Compound Inversive Pseudorandom VectorsFrank Emmerich — 1998
• Enumerating permutation polynomials II: k-cycles with minimal degreeClaudia Malvenuto, Francesco Pappalardi — 2004
• The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital netsLigia L. Cristea, Josef Dick, Gunther Leobacher — 2006
• On the Average Distribution of Inversive Pseudorandom NumbersHarald Niederreiter, Igor E. Shparlinski — 2002
• Compound inversive congruential pseudorandom numbers: an average-case analysisJürgen Eichenauer‐Herrmann, Frank Emmerich — 1996
• Explicit theorems on generator polynomialsStephen D. Cohen — 2005
• Brain function as evolutionBen Goertzel — 1992
• An existence theorem for cyclic triplewhist tournamentsIan Anderson, Stephen D. Cohen, Norman J. Finizio — 1995
• Are there hyperbolas in the scatter plots of inversive congruential pseudorandom numbersStefan Wegenkittl — 1998
• On the distribution of points in orbits of PGL(2,q) acting on GF(qn)Harald Niederreiter, Arne Winterhof — 2003
• Circular Tuscan-k Arrays from Permutation BinomialsWensong Chu, Solomon W. Golomb — 2002

Related papers

• Random number generation and Quasi-Monte Carlo methodsBruce Jay Collings, Harald Niederreiter — 1992
• Finite fieldsRudolf Lide, Harald Niederreiter — 1983
• Inversive congruential pseudorandom numbers : a tutorialJürgen Eichenauer‐Herrmann, Jürgen Eichenauer‐Herrmann — 1992
• A non-linear congruential pseudo random number generatorJürgen Eichenauer, Jürgen Lehn — 1986
• Pseudorandom Number Generation by Nonlinear MethodsJürgen Eichenauer‐Herrmann, Jürgen Eichenauer‐Herrmann — 1995
• Permutation polynomials over finite fieldsDaqing Wan — 1987
• Statistical independence of a new class of inversive congruential pseudorandom numbersJürgen Eichenauer‐Herrmann — 1993
• On inversive maximal period polynomials over finite fieldsWun-Seng Chou — 1995