default search action
Designs, Codes and Cryptography, Volume 23, 2001
Volume 23, Number 1, May 2001
- Igor E. Shparlinski:
On the Linear Complexity of the Power Generator. Des. Codes Cryptogr. 23(1): 5-10 (2001) - Koichi Betsumiya, Masaaki Harada:
Binary Optimal Odd Formally Self-Dual Codes. Des. Codes Cryptogr. 23(1): 11-22 (2001) - Tadashi Wadayama, Toru Hada, Koichiro Wakasugi, Masao Kasahara:
Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function. Des. Codes Cryptogr. 23(1): 23-34 (2001) - Blessilda P. Raposa:
Some Triple Block Intersection Numbers of Paley 2-Designs of QN-type. Des. Codes Cryptogr. 23(1): 35-52 (2001) - Andreas Enge:
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. Des. Codes Cryptogr. 23(1): 53-74 (2001) - Joel E. Iiams:
A Note on Certain 2-Groups with Hadamard Difference Sets. Des. Codes Cryptogr. 23(1): 75-80 (2001) - Christophe Mouaha, Gerhard Schiffels:
All qm-ary Cyclic Codes with Cyclic q-ary Image Are Known. Des. Codes Cryptogr. 23(1): 81-98 (2001) - Jianxing Yin:
A Combinatorial Construction for Perfect Deletion-Correcting Codes. Des. Codes Cryptogr. 23(1): 99-110 (2001)
Volume 23, Number 2, July 2001
- Iiro S. Honkala, Andrew Klapper:
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers. Des. Codes Cryptogr. 23(2): 131-146 (2001) - Igor E. Shparlinski:
On Some Properties of the Shrinking Generator. Des. Codes Cryptogr. 23(2): 147-156 (2001) - Tor Helleseth, P. Vijay Kumar, Halvard Martinsen:
A New Family of Ternary Sequences with Ideal Two-level Autocorrelation Function. Des. Codes Cryptogr. 23(2): 157-166 (2001) - T. Aaron Gulliver, Nikolai Senkevitch:
Optimal Ternary Linear Rate 1/2 Codes. Des. Codes Cryptogr. 23(2): 167-172 (2001) - Luke O'Connor:
On String Replacement Exponentiation. Des. Codes Cryptogr. 23(2): 173-184 (2001) - Bruce N. Cooperstein:
Hyperplane Sections of Kantor's Unitary Ovoids. Des. Codes Cryptogr. 23(2): 185-196 (2001) - Yves Edel, Jürgen Bierbrauer:
Large Caps in Small Spaces. Des. Codes Cryptogr. 23(2): 197-212 (2001) - Kenzi Akiyama:
On Certain Schur Rings of Dimension 4. Des. Codes Cryptogr. 23(2): 213-222 (2001) - Ilia Krasikov, Simon Litsyn:
On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptogr. 23(2): 223-232 (2001) - Marco Buratti, Fulvio Zuanni:
Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs. Des. Codes Cryptogr. 23(2): 233-248 (2001) - Joseph A. Thas:
Characterizations of Translation Generalized Quadrangles. Des. Codes Cryptogr. 23(2): 249-258 (2001)
Volume 23, Number 3, August 2001
- Christos Koukouvinos, Marilena Mitrouli, Jennifer Seberry:
Values of Minors of (1, -1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem. Des. Codes Cryptogr. 23(3): 267-282 (2001) - Nick Howgrave-Graham, Nigel P. Smart:
Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptogr. 23(3): 283-290 (2001) - Sharad S. Sane:
A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs. Des. Codes Cryptogr. 23(3): 291-296 (2001) - Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takagi:
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves. Des. Codes Cryptogr. 23(3): 297-316 (2001) - K. T. Arasu, Yu Qing Chen:
A Difference Set in. Des. Codes Cryptogr. 23(3): 317-324 (2001) - Koichi Betsumiya, Masaaki Harada:
Classification of Formally Self-Dual Even Codes of Lengths up to 16. Des. Codes Cryptogr. 23(3): 325-332 (2001) - Galina T. Bogdanova, Andries E. Brouwer, Stoyan N. Kapralov, Patric R. J. Östergård:
Error-Correcting Codes over an Alphabet of Four Elements. Des. Codes Cryptogr. 23(3): 333-342 (2001) - Kanat S. Abdukhalikov:
Affine Invariant and Cyclic Codes over -adic Numbers and Finite Rings. Des. Codes Cryptogr. 23(3): 343-370 (2001)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.