Andrew Klapper The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 1992, pp:327-338 [Conf]
Iiro S. Honkala, Andrew Klapper Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2001, v:23, n:2, pp:131-146 [Journal]
Andrew Klapper Cross-Correlations of Geometric Sequences in Characteristic Two. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1993, v:3, n:4, pp:347-377 [Journal]
Andrew Klapper Cross-Correlations of Quadratic Form Sequences in Odd Characteristic. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1997, v:11, n:3, pp:289-305 [Journal]
Andrew Klapper A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:25, n:3, pp:159-161 [Journal]
Andrew Klapper The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1994, v:7, n:1, pp:33-51 [Journal]
Mark Goresky, Andrew Klapper Fibonacci and Galois representations of feedback-with-carry shift registers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2826-2836 [Journal]
Mark Goresky, Andrew Klapper Pseudonoise sequences based on algebraic feedback shift registers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1649-1662 [Journal]
Mark Goresky, Andrew Klapper Arithmetic crosscorrelations of feedback with carry shift register sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1342-1345 [Journal]
Andrew Klapper Partial period crosscorrelations of geometric sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:256-260 [Journal]
Andrew Klapper Large families of sequences with near-optimal correlations and large linear span. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1241-1248 [Journal]
Andrew Klapper The multicovering radii of codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1372-1377 [Journal]
Andrew Klapper Improved multicovering bounds from linear inequalities and supercodes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:532-536 [Journal]
Andrew Klapper d-form sequences: families of sequences with low correlation values and large linear spans. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:423-431 [Journal]