default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 42, 2007
Volume 42, Number 1, January 2007
- Andrea Blunck, Hans Havlicek, Corrado Zanella
:
Lifting of divisible designs. 1-14 - Chong-Dao Lee, Yaotsu Chang, Trieu-Kien Truong:
A result on the weight distributions of binary quadratic residue codes. 15-20 - Peter Roelse:
The design of composite permutations with applications to DES-like S-boxes. 21-42 - Nevine Maurice Ebeid, M. Anwar Hasan:
On binary signed digit representations of integers. 43-65 - Simon Litsyn, Beniamin Mounits:
Improved lower bounds on sizes of single-error correcting codes. 67-72 - Jon-Lark Kim, Keith E. Mellinger, Leo Storme:
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles. 73-92 - Naoki Chigira, Masaaki Harada, Masaaki Kitazume:
Extremal self-dual codes of length 64 through neighbors and covering radii. 93-101 - Antonio Cossidente, Giuseppe Marino:
Veronese embedding and two-character sets. 103-107
Volume 42, Number 2, February 2007
- Bessie C. Hu, Duncan S. Wong, Zhenfeng Zhang, Xiaotie Deng:
Certificateless signature: a new security model and an improved generic construction. 109-126 - Jürgen Bierbrauer:
A direct approach to linear programming bounds for codes and tms-nets. 127-143 - Sanjeevani Gharge, Sharad S. Sane:
Quasi-affine symmetric designs. 145-166 - Amir J. Salomon, Ofer Amrani:
Reed-Muller codes and Barnes-Wall lattices: Generalized multilevel constructions and representation over GF(2q). 167-180 - Wilfried Meidl, Ayineedi Venkateswarlu:
Remarks on the k-error linear complexity of pn-periodic sequences. 181-193 - Maura B. Paterson:
Sliding-window dynamic frameproof codes. 195-212 - Santos González, Consuelo Martínez, Ignacio F. Rúa:
Symplectic spread-based generalized Kerdock codes. 213-226 - Dongvu Tonien, Reihaneh Safavi-Naini:
Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes. 227-237
Volume 42, Number 3, March 2007
- Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'hEigeartaigh, Michael Scott:
Efficient pairing computation on supersingular Abelian varieties. 239-271 - Taher Abualrub, Irfan Siap:
Cyclic codes over the rings Z2+uZ2 and Z2+uZ2 + u2Z2. 273-287 - Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan:
The linear programming bound for codes over finite Frobenius rings. 289-301 - Valentina Pepe:
LDPC codes from the Hermitian curve. 303-315 - Maura B. Paterson:
Sequential and dynamic frameproof codes. 317-326 - Gerardo Vega, Jacques Wolfmann:
New classes of 2-weight cyclic codes. 327-334 - Thomas Westerbäck:
Maximal partial packings of Z2n with perfect codes. 335-355
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 2026-07-11 00:13 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
