Journals in DBLP

Des. Codes Cryptography
2009, volume: 52, number: 1

1. 
   Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. [Citation Graph (, )][DBLP]
   
   
2. 
   Detection and identification of cheaters in ( t , n ) secret sharing scheme. [Citation Graph (, )][DBLP]
   
   
3. 
   Linear hash families and forbidden configurations. [Citation Graph (, )][DBLP]
   
   
4. 
   On circulant self-dual codes over small fields. [Citation Graph (, )][DBLP]
   
   
5. 
   A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. [Citation Graph (, )][DBLP]
   
   
6. 
   Indivisible plexes in latin squares. [Citation Graph (, )][DBLP]
   
   
7. 
   Optimal grid holey packings with block size 3 and 4. [Citation Graph (, )][DBLP]
   
   
8. 
   There exists no self-dual [24, 12, 10] code over \mathbb F₅{{\mathbb F}_5}. [Citation Graph (, )][DBLP]