A Numerical Note on Upper Bounds for B2[g] Sets. | 0 | 0.34 | 2018 |
A Tree-Based Approach for Computing Double-Base Chains | 20 | 0.95 | 2008 |
Integral zeroes of Krawtchouk polynomials. | 0 | 0.34 | 1999 |
Binary codes with covering radius one: some new lower bounds | 6 | 0.65 | 1997 |
On integer Chebyshev polynomials | 9 | 5.68 | 1997 |
Some new lower bounds for ternary covering codes | 3 | 0.54 | 1996 |
Sur les matrices à signes alternants | 3 | 0.49 | 1995 |
On-Line Evaluation of Powers Using Euclid's Algorithm | 1 | 0.39 | 1995 |
Lower bounds for q-ary coverings by spheres of radius one | 8 | 0.84 | 1994 |
Lower Bounds for q-ary Coverings by Spheres of Radius One. | 0 | 0.34 | 1994 |
More zeros of krawtchouk polynomials | 3 | 0.62 | 1993 |
Inequalities Between Elementary Symmetrical Functions - Application To Log-Concavity Problems | 0 | 0.34 | 1993 |
Good and bad radii of convex polygons | 5 | 1.60 | 1991 |
Autour de la Conjecture de Dyson | 0 | 0.34 | 1989 |