default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdvances in Mathematics of Communications, Volume 5
Volume 5, Number 1, February 2011
- Philip N. J. Eagle, Steven D. Galbraith
, John Ong:
Point compression for Koblitz elliptic curves. 1-10 - Thomas Honold, Ivan N. Landjev:
The dual construction for arcs in projective Hjelmslev spaces. 11-21 - Hyun Jin Kim, Heisook Lee, June Bok Lee, Yoonjin Lee:
Construction of self-dual codes with an automorphism of order p. 23-36 - Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
The minimum order of complete caps in PG(4, 4). 37-40 - Martianus Frederic Ezerman, San Ling, Patrick Solé, Olfa Yemen:
From skew-cyclic codes to asymmetric quantum codes. 41-57 - Yeow Meng Chee, Xiande Zhang, Hui Zhang:
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order. 59-68 - Konstantinos Drakakis, Francesco Iorio, Scott Rickard:
The enumeration of Costas arrays of order 28 and its consequences. 69-86 - Rainer Steinwandt, Adriana Suárez Corona:
Cryptanalysis of a 2-party key establishment based on a semigroup action problem. 87-92 - Dina Ghinelli, Jennifer D. Key:
Codes from incidence matrices and line graphs of Paley graphs. 93-108 - Elisavet Konstantinou, Aristides Kontogeorgis:
Some remarks on the construction of class polynomials. 109-118 - Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Linear nonbinary covering codes and saturating sets in projective spaces. 119-147
Volume 5, Number 2, May 2011
- Olof Heden, Denis S. Krotov:
On the structure of non-full-rank perfect q-ary codes. 149-156 - Frédéric Vanhove:
A geometric proof of the upper bound on the size of partial spreads in H(4n+1, q2). 157-160 - Tuvi Etzion, Alexander Vardy:
On q-analogs of Steiner systems and covering designs. 161-176 - Natalia Silberstein, Tuvi Etzion:
Large constant dimension codes and lexicodes. 177-189 - Stefka Bouyuklieva, Zlatko Varbanov:
Some connections between self-dual codes, combinatorial designs and secret sharing schemes. 191-198 - Ivica Martinjak, Mario-Osvin Pavcevic:
Symmetric designs possessing tactical decompositions. 199-208 - Anton Betten, Eun Ju Cheon, Seon Jeong Kim, Tatsuya Maruta:
The classification of (42, 6)8 arcs. 209-223 - Michael Braun:
On lattices, binary codes, and network codes. 225-232 - Irene Marquez Corbella, Edgar Martínez-Moro:
Algebraic structure of the minimal support codewords set of some linear codes. 233-244 - Thomas Feulner:
Canonization of linear codes over ℤ4. 245-266 - Stefka Bouyuklieva, Anton Malevich, Wolfgang Willems:
On the performance of binary extremal self-dual codes. 267-274 - Michael Kiermaier, Johannes Zwanzger:
A ℤ4-linear code of high minimum Lee distance derived from a hyperoval. 275-286 - Michael Kiermaier, Matthias Koch, Sascha Kurz:
2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ25. 287-301 - Peter Müller, Gábor Péter Nagy:
On the non-existence of sharply transitive sets of permutations in certain finite permutation groups. 303-308 - Ferenc Szöllösi:
On quaternary complex Hadamard matrices of small orders. 309-315 - Ivan N. Landjev, Assya Rousseva:
Characterization of some optimal arcs. 317-331 - Andreas Klein, Leo Storme:
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes. 333-337 - Bernardo Gabriel Rodrigues:
Some optimal codes related to graphs invariant under the alternating group A8. 339-350 - Klara Stokes, Maria Bras-Amorós:
Associating a numerical semigroup to the triangle-free configurations. 351-371 - Jennifer D. Key, Washiela Fish, Eric C. Mwambene:
Codes from the incidence matrices and line graphs of Hamming graphs Hk(n, 2) for k ≥ 2. 373-394 - Eimear Byrne:
On the weight distribution of codes over finite rings. 395-406 - Harald Fripertinger:
The number of invariant subspaces under a linear operator on finite vector spaces. 407-416
Volume 5, Number 3, August 2011
- Andries E. Brouwer, Tuvi Etzion:
Some new distance-4 constant weight codes. 417-424 - Helena Rifà-Pous, Josep Rifà, Lorena Ronquillo:
ℤ2ℤ4-additive perfect codes in Steganography. 425-433 - Konstantinos Drakakis:
On the degrees of freedom of Costas permutations and other constraints. 435-448 - Susanne Pumplün, Thomas Unger:
Space-time block codes from nonassociative division algebras. 449-471 - Gregory M. Zaverucha, Douglas R. Stinson:
Short one-time signatures. 473-488 - Olav Geil, Carlos Munuera, Diego Ruano, Fernando Torres:
On the order bounds for one-point AG codes. 489-504 - Tatsuya Maruta, Yusuke Oya:
On optimal ternary linear codes of dimension 6. 505-520 - Zhengchun Zhou, Xiaohu Tang:
New nearly optimal codebooks from relative difference sets. 521-527 - Csilla Bujtás, Zsolt Tuza:
Optimal batch codes: Many items or low retrieval requirement. 529-541 - Olof Heden, Martin Hessler:
On linear equivalence and Phelps codes. Addendum. 543-546 - Konstantinos Drakakis, Francesco Iorio, Scott Rickard, John Walsh:
Results of the enumeration of Costas arrays of order 29. 547-553
Volume 5, Number 4, November 2011
- Idan Goldenberg, David Burshtein:
Error bounds for repeat-accumulate codes decoded via linear programming. 555-570 - Steven T. Dougherty, Cristina Fernández-Córdoba:
Codes over ℤ2k, Gray map and self-dual codes. 571-588 - Kai-Uwe Schmidt:
The merit factor of binary arrays derived from the quadratic character. 589-607 - Natalia N. Tokareva:
On the number of bent functions from iterative constructions: lower bounds and hypotheses. 609-621 - Stefan Erickson, Michael J. Jacobson Jr., Andreas Stein:
Explicit formulas for real hyperelliptic curves of genus 2 in affine representation. 623-666 - Alexander Zeh, Antonia Wachter:
Fast multi-sequence shift-register synthesis with the Euclidean algorithm. 667-680 - Tsonka Baicheva:
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal. 681-686
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 2025-02-09 14:57 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:
