Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 25, 2002
Volume 25, Number 1, January 2002
- Stefka Bouyuklieva:
On the Automorphisms of Order 2 with Fixed Points for the Extremal Self-Dual Codes of Length 24m. Des. Codes Cryptogr. 25(1): 5-13 (2002) - Philip A. Eisen, Douglas R. Stinson:
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels. Des. Codes Cryptogr. 25(1): 15-61 (2002) - Arne Winterhof:
Polynomial Interpolation of the Discrete Logarithm. Des. Codes Cryptogr. 25(1): 63-72 (2002) - Etsuko Bannai, Mitsuhiro Sawano:
Symmetric Designs Attached to Four-Weight Spin Models. Des. Codes Cryptogr. 25(1): 73-90 (2002) - D. Brozovic, Chat Yin Ho, Akihiro Munemasa:
A Correction to "Incidence Matrices and Collineations of Finite Projective Planes" by Chat Yin Ho, Designs, Codes and Cryptography, 18 (1999). Des. Codes Cryptogr. 25(1): 91-93 (2002) - Tim Blackmore, Graham H. Norton:
Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptogr. 25(1): 95-115 (2002)
Volume 25, Number 2, February 2002
- K. T. Arasu, Warwick de Launey, Siu Lun Ma:
On Circulant Complex Hadamard Matrices. Des. Codes Cryptogr. 25(2): 123-142 (2002) - Sandy Ferret, Leo Storme:
Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa. Des. Codes Cryptogr. 25(2): 143-162 (2002) - Stelios Georgiou, Masaaki Harada, Christos Koukouvinos:
Orthogonal Designs and Type II Codes over Z2k. Des. Codes Cryptogr. 25(2): 163-174 (2002) - Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Des. Codes Cryptogr. 25(2): 175-188 (2002) - Jürgen Bierbrauer:
The Theory of Cyclic Codes and a Generalization to Additive Codes. Des. Codes Cryptogr. 25(2): 189-206 (2002) - Jorge Guajardo, Christof Paar:
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes. Des. Codes Cryptogr. 25(2): 207-216 (2002)
Volume 25, Number 3, March 2002
- Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer:
A Signature Scheme Based on the Intractability of Computing Roots. Des. Codes Cryptogr. 25(3): 223-236 (2002) - Massimo Giulietti, Fernanda Pambianco, Fernando Torres, Emanuela Ughi:
On Complete Arcs Arising from Plane Curves. Des. Codes Cryptogr. 25(3): 237-246 (2002) - Koen Thas:
A Theorem Concerning Nets Arising from Generalized Quadrangles with a Regular Point. Des. Codes Cryptogr. 25(3): 247-253 (2002) - Luis Martínez, Antonio Vera-López:
Ring-Valued Assignments to the Points of a t-Design. Des. Codes Cryptogr. 25(3): 255-262 (2002) - Claude Carlet, Yuriy V. Tarannikov:
Covering Sequences of Boolean Functions and Their Cryptographic Significance. Des. Codes Cryptogr. 25(3): 263-279 (2002) - Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear Key Predistribution Schemes. Des. Codes Cryptogr. 25(3): 281-298 (2002) - John B. Polhill:
Constructions of Nested Partial Difference Sets with Galois Rings. Des. Codes Cryptogr. 25(3): 299-309 (2002) - Edoardo Ballico, Antonio Cossidente:
Hermitian Veronesean Schemes. Des. Codes Cryptogr. 25(3): 311-317 (2002)
a service of 
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.
last updated on 2024-04-19 19:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
