Designs, Codes and Cryptography, Volume 41, 2006

Volume 41, Number 1, October 2006

• Reihaneh Safavi-Naini, Huaxiong Wang:
  Secret sharing schemes with partial broadcast channels. 5-22
  
• Julien Moncel:
  Constructing codes identifying sets of vertices. 23-31
  
• Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker:
  Roux-type constructions for covering arrays of strengths three and four. 33-57
  
• Iliya Bouyukliev, Veerle Fack, Wolfgang Willems, Joost Winne:
  Projective two-weight codes with small parameters and their corresponding graphs. 59-78
  
• Peter Keevash, Cheng Yeaw Ku:
  A random construction for permutation codes and the covering radius. 79-86
  
• Vince Grolmusz:
  Pairs of codes with prescribed Hamming distances and coincidences. 87-99
  
• Stefka Bouyuklieva, Patric R. J. Östergård:
  New constructions of optimal self-dual binary codes of length 54. 101-109
  
• K. T. Arasu, Ka Hin Leung, Siu Lun Ma, Ali Nabavi, D. K. Ray-Chaudhuri:
  Circulant weighing matrices of weight 2^2t. 111-123
  

Volume 41, Number 2, November 2006

• Vikram Jha, Norman L. Johnson:
  Subregular planes admitting elations. 125-145
  
• Marcelo Muniz:
  Isometric embeddings of Z_p^k in the Hamming space F_p^N and Z_p^k-linear codes. 147-152
  
• Robert F. Bailey:
  Uncoverings-by-bases for base-transitive permutation groups. 153-176
  
• Zhenfu Cao, Gennian Ge, Ying Miao:
  Combinatorial characterizations of one-coincidence frequency-hopping sequences. 177-184
  
• Stefko Miklavic, Primoz Potocnik:
  Distance-transitive dihedrants. 185-193
  
• Carl Bracken, Gary McGuire, Harold N. Ward:
  New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices. 195-198
  
• C. Galindo, M. Sanchis:
  Evaluation codes and plane valuations. 199-219
  
• Lihua Liu, Hao Shen:
  Explicit constructions of separating hash families from algebraic curves over finite fields. 221-233
  

Volume 41, Number 3, December 2006

• Steven T. Dougherty, T. Aaron Gulliver, John N. C. Wong:
  Self-dual codes over Z₈ and Z₉. 235-249
  
• Takehiro Hasegawa, Shoichi Kondo, Hidekazu Kurusu:
  A sequence of one-point codes from a tower of function fields. 251-267
  
• Jun Shen, Hao Shen:
  Embeddings of resolvable group divisible designs with block size 3. 269-298
  
• Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong:
  Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields. 299-306
  
• Ali Miri, Monica Nevins, Terasan Niyomsataya:
  Applications of representation theory to wireless communications. 307-318
  
• Carl Bracken:
  New classes of self-complementary codes and quasi-symmetric designs. 319-323
  
• Pascal O. Vontobel, Ashwin Ganesan:
  On universally decodable matrices for space-time coding. 325-342
  
• Ferruh Özbudak, Zülfükar Saygi:
  Some constructions of systematic authentication codes using galois rings. 343-357
  

Last update Wed Feb 15 05:30:35 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page