Designs, Codes and Cryptography, Volume 30, 2003

Volume 30, Number 1, August 2003

Siaw-Lynn Ng:
A Representation of a Family of Secret Sharing Matroids. 5-19
Maria Axenovich, Zoltán Füredi:
Exact Bounds on the Sizes of Covering Codes. 21-38
Shengli Liu, Henk C. A. van Tilborg, Marten van Dijk:
A Practical Protocol for Advantage Distillation and Information Reconciliation. 39-62
Keith E. Mellinger:
A Geometric Relationship Between Equivalent Spreads. 63-71
Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve:
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. 73-84
Antonia W. Bluher:
On x⁶ + x + a in Characteristic Three. 85-95
Iliya Bouyukliev, Juriaan Simonis:
Some New Results on Optimal Codes Over F⁵. 97-111
San Ling, Patrick Solé:
On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings. 113-130

Hadi Kharaghani:
On a Class of Symmetric Balanced Generalized Weighing Matrices. 139-149
Daniel B. Dalan:
New Extremal Type I Codes of Lengths 40, 42, and 44. 151-157
Massimiliano Sala:
Upper Bounds on the Dual Distance of BCH(255, k). 159-168
Kenichiro Tanabe:
A Criterion for Designs in {\tf="P101461" Z}_4-codes on the Symmetrized Weight Enumerator. 169-185
Jon-Lark Kim, Vera Pless:
Designs in Additive Codes over GF(4). 187-199
Phong Q. Nguyen, Igor Shparlinski:
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. 201-217
Ilaria Cardinali, Olga Polverino, Rocco Trombetti:
On the Sporadic Semifield Flock. 219-226

Palash Sarkar, Paul J. Schellenberg:
Construction of Symmetric Balanced Squares with Blocksize More than One. 235-280
Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber:
Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. 281-299
Ederlina G. Nocon:
On the Construction of Some Type II Codes over Z₄×Z₄. 301-323
David B. Chandler, Qing Xiang:
Cyclic Relative Difference Sets and their p-Ranks. 325-343

Last update Tue Feb 14 04:16:49 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page