default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdvances in Mathematics of Communications, Volume 3
Volume 3, Number 1, February 2009
- Douglas A. Leonard:
A weighted module view of integral closures of affine domains of type I. 1-11 - Maura B. Paterson
, Douglas R. Stinson, Ruizhong Wei:
Combinatorial batch codes. 13-27 - Ayako Kikui, Tatsuya Maruta, Yuri Yoshida:
On the uniqueness of (48, 6)-arcs in PG(2, 9). 29-34 - Konstantinos Drakakis, Roderick Gow, Scott Rickard:
Common distance vectors between Costas arrays. 35-52 - Philippa Liana Charters:
Finding an asymptotically bad family of q-th power residue codes. 53-58 - Yves Edel, Alexander Pott:
A new almost perfect nonlinear function which is not quadratic. 59-81 - Andrew Klapper, Andrew Mertz:
The two covering radius of the two error correcting BCH code. 83-95 - David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. 97-114
Volume 3, Number 2, May 2009
- Ji-Woong Jang, Young-Sik Kim, Sang-Hyo Kim:
New design of quaternary LCZ and ZCZ sequence set from binary LCZ and ZCZ sequence set. 115-124 - Lasse Kiviluoto, Patric R. J. Östergård, Vesa P. Vaskelainen:
Sperner capacity of small digraphs. 125-133 - Kai-Uwe Schmidt, Jonathan Jedwab, Matthew Geoffrey Parker:
Two binary sequence families with large merit factor. 135-156 - Axel Kohnert, Johannes Zwanzger:
New linear codes with prescribed group of automorphisms found by heuristic search. 157-166 - Dae San Kim:
Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups. 167-178 - Heide Gluesing-Luerssen:
On isometries for convolutional codes. 179-203 - Santanu Sarkar, Subhamoy Maitra:
Further results on implicit factoring in polynomial time. 205-217
Volume 3, Number 3, August 2009
- Carl Bracken, Zhengbang Zha:
On the Fourier spectra of the infinite families of quadratic APN functions. 219-226 - Sergio R. López-Permouth, Benigno R. Parra-Avila, Steve Szabo:
Dual generalizations of the concept of cyclicity of codes. 227-234 - Konstantinos Drakakis:
A review of the available construction methods for Golomb rulers. 235-250 - Christos Koukouvinos, Dimitris E. Simos:
Construction of new self-dual codes over GF(5) using skew-Hadamard matrices. 251-263 - Hakan Özadam, Ferruh Özbudak:
A note on negacyclic and cyclic codes of length ps over a finite field of characteristic p. 265-271 - Yvo Desmedt, Niels Duif, Henk van Tilborg, Huaxiong Wang:
Bounds and constructions for key distribution schemes. 273-293 - Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the existence of extended perfect binary codes with trivial symmetry group. 295-309
Volume 3, Number 4, November 2009
- Masaaki Harada, Katsushi Waki:
New extremal formally self-dual even codes of length 30. 311-316 - José Ignacio Iglesias Curto:
Generalized AG convolutional codes. 317-328 - Lars Eirik Danielsen:
Graph-based classification of self-dual additive codes over finite fields. 329-348 - Ilias S. Kotsireas, Christos Koukouvinos, Dimitris E. Simos:
MDS and near-MDS self-dual codes over large prime fields. 349-361 - Thomas Feulner:
The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. 363-383 - Olof Heden, Faina I. Solov'eva:
Partitions of Fn into non-parallel Hamming codes. 385-397 - Carlos Munuera, Alonso Sepúlveda, Fernando Torres:
Castle curves and codes. 399-408 - Sergio R. López-Permouth, Steve Szabo:
On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. 409-420 - Zilong Wang, Guang Gong, Rongquan Feng:
A generalized construction of OFDM M-QAM sequences with low peak-to-average power ratio. 421-428 - David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. 429-430
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-11-11 21:18 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:
