Journals in DBLP

Des. Codes Cryptography
2001, volume: 22, number: 3

1. Michel Sebille
   There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:215-219 [Journal]
   
2. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
   On Perfect Codes and Related Concepts. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:221-237 [Journal]
   
3. Renate Scheidler
   Cryptography in Quadratic Function Fields. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:239-264 [Journal]
   
4. Kaoru Kurosawa, Satoshi Obana
   Combinatorial Bounds on Authentication Codes with Arbitration. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:265-281 [Journal]
   
5. Vikram Jha, Norman L. Johnson
   Almost Desarguesian Maximal Partial Spreads. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:283-304 [Journal]
   
6. Alexander A. Davydov
   New Constructions of Covering Codes. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:305-316 [Journal]
   
7. Karl Brincat
   On the Use of RSA as a Secret Key Cryptosystem. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:317-329 [Journal]
   
8. Olof Heden
   A Maximal Partial Spread of Size 45 in PG(3, 7). [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2001, v:22, n:3, pp:331-334 [Journal]