default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 22, 2001
Volume 22, Number 1, January 2001
- Ákos Seress:
All Lambda-Designs With are Type-1. Des. Codes Cryptogr. 22(1): 5-17 (2001) - Antonio Cossidente, Domenico Labbate, Alessandro Siciliano:
Veronese Varieties Over Finite Fields and Their Projections. Des. Codes Cryptogr. 22(1): 19-32 (2001) - Sylvie Dubuc:
Characterization of Linear Structures. Des. Codes Cryptogr. 22(1): 33-45 (2001) - Satoshi Obana, Kaoru Kurosawa:
Bounds and Combinatorial Structure of Multi-Receiver-Codes. Des. Codes Cryptogr. 22(1): 47-63 (2001) - Joan Daemen, Lars R. Knudsen, Vincent Rijmen:
Linear Frameworks for Block Ciphers. Des. Codes Cryptogr. 22(1): 65-87 (2001) - T. Aaron Gulliver, Masaaki Harada:
Codes over and Improvements to the Bounds on Ternary Linear Codes. Des. Codes Cryptogr. 22(1): 89-96 (2001)
Volume 22, Number 2, March 2001
- Gretchen L. Matthews:
Weierstrass Pairs and Minimum Distance of Goppa Codes. Des. Codes Cryptogr. 22(2): 107-121 (2001) - Arne Winterhof:
Some Estimates for Character Sums and Applications. Des. Codes Cryptogr. 22(2): 123-131 (2001) - Douglas R. Stinson:
Something About All or Nothing (Transforms). Des. Codes Cryptogr. 22(2): 133-138 (2001) - Harold N. Ward:
The Nonexistence of a [207, 4, 165] Code over GF(5). Des. Codes Cryptogr. 22(2): 139-148 (2001) - Kenichiro Tanabe:
A New Proof of the Assmus-Mattson Theorem for Non-Binary Codes. Des. Codes Cryptogr. 22(2): 149-155 (2001) - Agnes V. Dizon-Garciano, Yutaka Hiramine:
On Sylow Subgroups of Abelian Affine Difference Sets. Des. Codes Cryptogr. 22(2): 157-163 (2001) - Tatsuya Maruta:
On the Nonexistence of q-ary Linear Codes of Dimension Five. Des. Codes Cryptogr. 22(2): 165-177 (2001) - Norman L. Johnson:
Two-Transitive Parallelisms. Des. Codes Cryptogr. 22(2): 179-189 (2001) - Ulrich Dempwolff:
Primitive Rank 3 Groups on Symmetric Designs. Des. Codes Cryptogr. 22(2): 191-207 (2001)
Volume 22, Number 3, 2001
- Michel Sebille:
There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t. Des. Codes Cryptogr. 22(3): 215-219 (2001) - Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Perfect Codes and Related Concepts. Des. Codes Cryptogr. 22(3): 221-237 (2001) - Renate Scheidler:
Cryptography in Quadratic Function Fields. Des. Codes Cryptogr. 22(3): 239-264 (2001) - Kaoru Kurosawa, Satoshi Obana:
Combinatorial Bounds on Authentication Codes with Arbitration. Des. Codes Cryptogr. 22(3): 265-281 (2001) - Vikram Jha, Norman L. Johnson:
Almost Desarguesian Maximal Partial Spreads. Des. Codes Cryptogr. 22(3): 283-304 (2001) - Alexander A. Davydov:
New Constructions of Covering Codes. Des. Codes Cryptogr. 22(3): 305-316 (2001) - Karl Brincat:
On the Use of RSA as a Secret Key Cryptosystem. Des. Codes Cryptogr. 22(3): 317-329 (2001) - Olof Heden:
A Maximal Partial Spread of Size 45 in PG(3, 7). Des. Codes Cryptogr. 22(3): 331-334 (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.
last updated on 2025-02-21 19:34 CET 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:
