Wilfried Meidl How Many Bits have to be Changed to Decrease the Linear Complexity?. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:33, n:2, pp:109-122 [Journal]
J. L. Hayden Eigenvalues of Finite Projective Planes with an Abelian Cartesian Group. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:33, n:2, pp:159-172 [Journal]