default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 52, 2009
Volume 52, Number 1, July 2009
- Jaume Martí-Farré
, Carles Padró:
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. 1-14 - Lein Harn, Changlu Lin:
Detection and identification of cheaters in ( t , n ) secret sharing scheme. 15-24 - Charles J. Colbourn, Alan C. H. Ling:
Linear hash families and forbidden configurations. 25-55 - Markus Grassl, T. Aaron Gulliver:
On circulant self-dual codes over small fields. 57-81 - Yu-Ru Liu, Craig V. Spencer:
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. 83-91 - Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless:
Indivisible plexes in latin squares. 93-105 - Bin Wen, Jianmin Wang, Jianxing Yin:
Optimal grid holey packings with block size 3 and 4. 107-124 - Masaaki Harada, Akihiro Munemasa:
There exists no self-dual [24, 12, 10] code over \mathbb F5{{\mathbb F}_5}. 125-127
Volume 52, Number 2, August 2009
- Tamir Tassa, Jorge L. Villar:
On proper secrets, ( t , k )-bases and linear codes. 129-154 - Bader F. AlBdaiwi, Peter Horák, Lorenzo Milazzo:
Enumerating and decoding perfect linear Lee codes. 155-162 - John B. Polhill:
Paley type partial difference sets in non p-groups. 163-169 - E. J. Cheon, Tatsuya Maruta:
A new extension theorem for 3-weight modulo q linear codes over Fq. 171-183 - Clemens Heuberger, James A. Muir:
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. 185-208 - Paul Dorbec, Sylvain Gravier, Iiro S. Honkala, Michel Mollard:
Weighted codes in Lee metrics. 209-218 - Kenneth G. Paterson, Sriramkrishnan Srinivasan:
On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. 219-241 - Alan R. Prince:
Pure partial planes of order 6 with 25 lines. 243-247
Volume 52, Number 3, September 2009
- Tian Tian, Wen-Feng Qi:
Linearity properties of binary FCSR sequences. 249-262 - Brian Curtin, Ibtisam Daqqa:
The subconstituent algebra of strongly regular graphs associated with a Latin square. 263-274 - Miwako Mishima, Hung-Lin Fu, Shoichi Uruno:
Optimal conflict-avoiding codes of length n = 0 (mod 16) and weight 3. 275-291 - Andrea Caranti, Francesca Dalla Volta, Massimiliano Sala:
An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher. 293-301 - Claude Carlet, Xiangyong Zeng, Chunlei Li, Lei Hu:
Further properties of several classes of Boolean functions with optimum algebraic immunity. 303-338 - Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai:
An improvement of discrete Tardos fingerprinting codes. 339-362 - Jon-Lark Kim, Xiaoyu Liu:
A generalized Gleason-Pierce-Ward theorem. 363-380 - Dustin Moody:
The Diffie-Hellman problem and generalization of Verheul's theorem. 381-390
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-10-31 20:15 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:
