![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 53 matches
- 1989
- Gérard D. Cohen, Jacques Wolfmann:
Coding Theory and Applications, 3rd International Colloquium, Toulon, France, November 2-4, 1988, Proceedings. Lecture Notes in Computer Science 388, Springer 1989, ISBN 3-540-51643-3 [contents] - 1988
- Gerard Battail:
Weighted decoding of linear block codes by solving a system of implicit equations. Coding Theory and Applications 1988: 123-133 - Gerard Battail:
Is minimal distance a good criterion? Coding Theory and Applications 1988: 325-327 - Dominique Le Brigand:
Polynomial factorization using Brill-Noether algorithm. Coding Theory and Applications 1988: 37-46 - Paul Camion, Jean-Luc Politano:
Evaluation of a coding design for a very noisy channel. Coding Theory and Applications 1988: 301-311 - Claude Carlet:
A simple description of Kerdock codes. Coding Theory and Applications 1988: 202-208 - M. Carral, D. Rotillon, A. Thiong Ly:
Codes from Artin-Schreier curves. Coding Theory and Applications 1988: 13-27 - Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang:
Generating codewords in real space: Application to decoding. Coding Theory and Applications 1988: 114-122 - J. L. Dalmau, J. A. Delgado, Llorenç Huguet i Rotger, Inma Ortuño Ortin, R. Valle:
Concatenated coding schemes for HF channels. Coding Theory and Applications 1988: 269-278 - Jean-Louis Dornstetter:
The future pan european mobile radiotelephone system: a short overview. Coding Theory and Applications 1988: 247-254 - Patrick Fitzpatrick, Graham H. Norton:
Linear recurrence relations and an extended subresultant algorithm. Coding Theory and Applications 1988: 232-243 - Arif Ghafoor, Patrick Solé:
Covering in Hypercubes. Coding Theory and Applications 1988: 213-225 - Sami Harari:
A new authentication algorithm. Coding Theory and Applications 1988: 91-105 - Gilles Lachaud:
Exponential sums and the Carlitz-Uchiyama bound. Coding Theory and Applications 1988: 63-75 - Jean François Maurras:
More on the plane of order 10. Coding Theory and Applications 1988: 226-231 - Charles Narçon:
Design and implementation of an asynchronous transmission process by code division multiple access. Coding Theory and Applications 1988: 312-322 - Marc Perret:
Families of codes exceeding the Varshamov-Gilbert bound. Coding Theory and Applications 1988: 28-36 - Philippe Piret:
Bounds on the use of the postal channel. Coding Theory and Applications 1988: 79-90 - Patrice Rabizzoni:
Relation between the minimum weight of a linear code over GF(qm) and its q-art image over GF(q). Coding Theory and Applications 1988: 209-212 - Philippe R. Sadot, Jean-Luc Politano:
Errcr correcting coding scheme against partial time jammers. Coding Theory and Applications 1988: 294-300 - Christian Schlegel, Daniel J. Costello Jr.:
Bandwidth efficient coding on channels disturbed by jamming and impulse noise. Coding Theory and Applications 1988: 279-293 - Rémi Sfez, Jean-Claude Belfiore:
Suboptimum weighted-output symbol-by-symbol decoding of block codes. Coding Theory and Applications 1988: 134-146 - Patrick Solé:
A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties. Coding Theory and Applications 1988: 193-201 - Patrick Solé:
Covering radius of the circuit code. Coding Theory and Applications 1988: 328 - Patrick Solé:
Cyclic codes over rings and p-adic fields. Coding Theory and Applications 1988: 329 - Jacques Stern:
A method for finding codewords of small weight. Coding Theory and Applications 1988: 106-113 - J. A. Thiong-Ly:
Note for computing the minimum polynomied of elements in large finite fields. Coding Theory and Applications 1988: 185-192 - Aimo Tietäväinen:
Codes and character sums. Coding Theory and Applications 1988: 3-12 - Henk C. A. van Tilborg:
An overview of recent results in the theory of burst-correcting codes. Coding Theory and Applications 1988: 164-184 - Jacques Wolfmann:
New bounds on cyclic codes from algebraic curves. Coding Theory and Applications 1988: 47-62
skipping 23 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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 2024-09-08 14:25 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