![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2009
- 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. Adv. Math. Commun. 3(1): 97-114 (2009) - David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - Carl Bracken, Zhengbang Zha:
On the Fourier spectra of the infinite families of quadratic APN functions. Adv. Math. Commun. 3(3): 219-226 (2009) - Philippa Liana Charters:
Finding an asymptotically bad family of q-th power residue codes. Adv. Math. Commun. 3(1): 53-58 (2009) - José Ignacio Iglesias Curto:
Generalized AG convolutional codes. Adv. Math. Commun. 3(4): 317-328 (2009) - Lars Eirik Danielsen:
Graph-based classification of self-dual additive codes over finite fields. Adv. Math. Commun. 3(4): 329-348 (2009) - Yvo Desmedt, Niels Duif, Henk van Tilborg, Huaxiong Wang:
Bounds and constructions for key distribution schemes. Adv. Math. Commun. 3(3): 273-293 (2009) - Konstantinos Drakakis:
A review of the available construction methods for Golomb rulers. Adv. Math. Commun. 3(3): 235-250 (2009) - Konstantinos Drakakis, Roderick Gow, Scott Rickard:
Common distance vectors between Costas arrays. Adv. Math. Commun. 3(1): 35-52 (2009) - Yves Edel, Alexander Pott:
A new almost perfect nonlinear function which is not quadratic. Adv. Math. Commun. 3(1): 59-81 (2009) - Thomas Feulner:
The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. Adv. Math. Commun. 3(4): 363-383 (2009) - Heide Gluesing-Luerssen:
On isometries for convolutional codes. Adv. Math. Commun. 3(2): 179-203 (2009) - Masaaki Harada, Katsushi Waki:
New extremal formally self-dual even codes of length 30. Adv. Math. Commun. 3(4): 311-316 (2009) - Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the existence of extended perfect binary codes with trivial symmetry group. Adv. Math. Commun. 3(3): 295-309 (2009) - Olof Heden, Faina I. Solov'eva:
Partitions of Fn into non-parallel Hamming codes. Adv. Math. Commun. 3(4): 385-397 (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. Adv. Math. Commun. 3(2): 115-124 (2009) - Ayako Kikui, Tatsuya Maruta, Yuri Yoshida:
On the uniqueness of (48, 6)-arcs in PG(2, 9). Adv. Math. Commun. 3(1): 29-34 (2009) - Dae San Kim
:
Infinite families of recursive formulas generating power moments of ternary Kloosterman sums with square arguments arising from symplectic groups. Adv. Math. Commun. 3(2): 167-178 (2009) - Lasse Kiviluoto, Patric R. J. Östergård, Vesa P. Vaskelainen:
Sperner capacity of small digraphs. Adv. Math. Commun. 3(2): 125-133 (2009) - Andrew Klapper, Andrew Mertz:
The two covering radius of the two error correcting BCH code. Adv. Math. Commun. 3(1): 83-95 (2009) - Axel Kohnert, Johannes Zwanzger:
New linear codes with prescribed group of automorphisms found by heuristic search. Adv. Math. Commun. 3(2): 157-166 (2009) - Ilias S. Kotsireas, Christos Koukouvinos, Dimitris E. Simos:
MDS and near-MDS self-dual codes over large prime fields. Adv. Math. Commun. 3(4): 349-361 (2009) - Christos Koukouvinos, Dimitris E. Simos
:
Construction of new self-dual codes over GF(5) using skew-Hadamard matrices. Adv. Math. Commun. 3(3): 251-263 (2009) - Douglas A. Leonard:
A weighted module view of integral closures of affine domains of type I. Adv. Math. Commun. 3(1): 1-11 (2009) - Sergio R. López-Permouth, Benigno R. Parra-Avila, Steve Szabo:
Dual generalizations of the concept of cyclicity of codes. Adv. Math. Commun. 3(3): 227-234 (2009) - Sergio R. López-Permouth, Steve Szabo:
On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. Adv. Math. Commun. 3(4): 409-420 (2009) - Carlos Munuera
, Alonso Sepúlveda
, Fernando Torres
:
Castle curves and codes. Adv. Math. Commun. 3(4): 399-408 (2009) - Hakan Özadam, Ferruh Özbudak
:
A note on negacyclic and cyclic codes of length ps over a finite field of characteristic p. Adv. Math. Commun. 3(3): 265-271 (2009) - Maura B. Paterson
, Douglas R. Stinson, Ruizhong Wei:
Combinatorial batch codes. Adv. Math. Commun. 3(1): 13-27 (2009) - Santanu Sarkar
, Subhamoy Maitra:
Further results on implicit factoring in polynomial time. Adv. Math. Commun. 3(2): 205-217 (2009)
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-16 18:01 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint