Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDesigns, Codes and Cryptography, Volume 40, 2006
Volume 40, Number 1, July 2006
Masaaki Homma, Seon Jeong Kim:
The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve. 5-24- Peter J. Grabner, Clemens Heuberger:
On the Number of Optimal Base 2 Representations of Integers. 25-39 - Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarkar:
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. 41-58 - Claude Carlet, Cunsheng Ding, Harald Niederreiter:
Authentication Schemes from Highly Nonlinear Functions. 71-79 - Hiroki Koga, Etsuyo Ueda:
Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels. 81-102 - Javier Herranz, Germán Sáez:
Distributed Ring Signatures from General Dual Access Structures. 103-120
Volume 40, Number 2, August 2006
- Yen-Ying Huang, Shi-Chun Tsai, Hsin-Lung Wu:
On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations. 139-155 - Yanxun Chang, Cunsheng Ding:
Constructions of External Difference Families and Disjoint Difference Families. 167-185 - Shoulun Long, Josef Pieprzyk, Huaxiong Wang, Duncan S. Wong:
Generalised Cumulative Arrays in Secret Sharing. 191-209 - R. Julian R. Abel, Frank E. Bennett:
The Existence of (nu, 6, lambda)-Perfect Mendelsohn Designs with lambda > 1. 211-224 - Mike J. Grannell, Terry S. Griggs, Anne Penfold Street:
A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes. 225-236 - Andreas Faldum, Julio Lafuente, Gustavo Ochoa, Wolfgang Willems:
Error Probabilities for Bounded Distance Decoding. 237-252
Volume 40, Number 3, September 2006
- Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless:
The number of transversals in a Latin square. 269-284 - David G. Glynn, Johannes G. Maks, Rey Casse:
The polynomial degree of the Grassmannian G(1, n, q) of lines in finite projective space PG(n, q). 335-341 - Sean V. Droms, Keith E. Mellinger, Chris Meyer:
LDPC codes generated by conics in the classical projective plane. 343-356 - Hassan Aly, Arne Winterhof:
On the k-error linear complexity over \mathbbFp of Legendre and Sidelnikov sequences. 369-374
maintained by 
, founded at 
, founded at 
last updated on 2019-02-16 22:21 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
