Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, 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 - François Rodier:
Asymptotic Nonlinearity of Boolean Functions. 59-70 - 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 - Anthony B. Evans:
Latin Squares without Orthogonal Mates. 121-130 - Ian M. Wanless, Bridget S. Webb:
The Existence of Latin Squares without Orthogonal Mates. 131-135
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 - Cunsheng Ding, Jianxing Yin:
A Construction of Optimal Constant Composition Codes. 157-165 - Yanxun Chang, Cunsheng Ding:
Constructions of External Difference Families and Disjoint Difference Families. 167-185 - Octavio Páez Osuna:
There are 1239 Steiner Triple Systems STS(31) of 2-rank 27. 187-190 - 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
- Mausumi Bose, Rahul Mukerjee:
Optimal (2, n) visual cryptographic schemes. 255-267 - Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless:
The number of transversals in a Latin square. 269-284 - Christopher Wolf, An Braeken, Bart Preneel:
On the security of stepwise triangular systems. 285-302 - Gennian Ge, Ying Miao, Lie Zhu:
GOB designs for authentication codes with arbitration. 303-317 - Olof Heden, Martin Hessler:
On the classification of perfect codes: side class structures. 319-333 - 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 - Peter Horák, Bader F. AlBdaiwi:
Fast decoding of quasi-perfect Lee distance codes. 357-367 - Hassan Aly, Arne Winterhof:
On the k-error linear complexity over \mathbbFp of Legendre and Sidelnikov sequences. 369-374
a service of 
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-04-19 19:20 CEST 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:
