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 24 matches
- 1986
- Alain Poli:
Applied Algebra, Algorithms and Error-Correcting Codes, 2nd International Conference, AAECC-2, Toulouse, France, October 1-5, 1984, Proceedings. Lecture Notes in Computer Science 228, Springer 1986, ISBN 3-540-16767-6 [contents] - 1984
- Annie Astié-Vidal, J. Chifflet:
Distance-transitive graphs and the problem of maximal subgroups of symmetric groups. AAECC 1984: 206-214 - Oscar Moreno de Ayala:
Discriminants and the irreducibility of a class of polynomials. AAECC 1984: 178-181 - Lucien Bénéteau, Jacqueline Lacaze:
Designs arising from symplectic geometry. AAECC 1984: 198-205 - Thomas Beth:
Codes, groups and invariants. AAECC 1984: 71-78 - Jacques Calmet:
Manipulation of recurrence relations in computer algebra. AAECC 1984: 242-252 - Jacques Calmet, Marc Bergman:
Some design principles for a mathematical knowledge representation system: a new approach to scientific calculation. AAECC 1984: 253-265 - Paul Camion:
Can a fast signature scheme without secret key be secure?. AAECC 1984: 215-241 - Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89 - Bernard Courteau, Jean Goulet:
Une classe de codes 2-correcteurs adaptés aux systèmes d'information. AAECC 1984: 136-144 - Jean-Louis Dornstetter:
Some quasi-perfect cyclic codes. AAECC 1984: 122-129 - Gui Liang Feng, Kenneth K. Tzeng:
An algorithm of complete decoding of double-error-correcting Goppa codes. AAECC 1984: 154-160 - M. C. Gennero:
Lousticc simulation software: experimental results of coding systems. AAECC 1984: 145-153 - Joos Heintz, Jacques Morgenstern:
On associative algebras of minimal rank. AAECC 1984: 1-24 - Hideki Imai:
Multivariate polynomials in coding theory. AAECC 1984: 36-60 - Douglas A. Leonard, C. A. Rodger:
Explicit Kerdock codes over GF(2). AAECC 1984: 130-135 - Denis Lugiez:
Multivariate polynomial factoring and detection of true factors. AAECC 1984: 169-177 - H. F. Mattson Jr.:
An improved upper bound on covering radius. AAECC 1984: 90-106 - H. Michael Möller, Ferdinando Mora:
Computational aspects of reduction strategies to construct resolutions of monomial ideals. AAECC 1984: 182-197 - Philippe Piret:
On the number of divisors of a polynomial over GF(2). AAECC 1984: 161-168 - Alain Poli:
Construction of primitive idempotents for n variable codes. AAECC 1984: 25-35 - Alain Poli, C. Rigoni:
Enumeration of self dual 2k circulant codes. AAECC 1984: 61-70 - Llorenç Huguet i Rotger, Mercè Griera:
Association schemes and difference sets defined on two weight codes. AAECC 1984: 107-111 - J. A. Thiong-Ly:
Automorphisms of two families of extended non binary cyclic Goppa codes. AAECC 1984: 112-121
loading more results
failed to load more results, please try again later
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 2024-10-21 05:14 CEST 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