Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoding Theory and Applications 1988: Toulon, France
- 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
Coding and Algegraic Geometry
- Aimo Tietäväinen:
Codes and character sums. 3-12 - M. Carral, D. Rotillon, A. Thiong Ly:
Codes from Artin-Schreier curves. 13-27 - Marc Perret:
Families of codes exceeding the Varshamov-Gilbert bound. 28-36 - Dominique Le Brigand:
Polynomial factorization using Brill-Noether algorithm. 37-46 - Jacques Wolfmann:
New bounds on cyclic codes from algebraic curves. 47-62 - Gilles Lachaud:
Exponential sums and the Carlitz-Uchiyama bound. 63-75
Information Theory, Decoding and Cryptography
- Philippe Piret:
Bounds on the use of the postal channel. 79-90 - Sami Harari:
A new authentication algorithm. 91-105 - Jacques Stern:
A method for finding codewords of small weight. 106-113 - Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang:
Generating codewords in real space: Application to decoding. 114-122 - Gerard Battail:
Weighted decoding of linear block codes by solving a system of implicit equations. 123-133 - Rémi Sfez, Jean-Claude Belfiore:
Suboptimum weighted-output symbol-by-symbol decoding of block codes. 134-146 - Y. P. Zhu, Philippe Godlewski:
Results of generalized minimum distance decoding for block code of rate 1/2. 147-161
Cominatorial and Algebraic Aspects
- Henk C. A. van Tilborg:
An overview of recent results in the theory of burst-correcting codes. 164-184 - J. A. Thiong-Ly:
Note for computing the minimum polynomied of elements in large finite fields. 185-192 - Patrick Solé:
A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties. 193-201 - Claude Carlet:
A simple description of Kerdock codes. 202-208 - Patrice Rabizzoni:
Relation between the minimum weight of a linear code over GF(qm) and its q-art image over GF(q). 209-212 - Arif Ghafoor, Patrick Solé:
Covering in Hypercubes. 213-225 - Jean François Maurras:
More on the plane of order 10. 226-231 - Patrick Fitzpatrick, Graham H. Norton:
Linear recurrence relations and an extended subresultant algorithm. 232-243
Applications
- Jean-Louis Dornstetter:
The future pan european mobile radiotelephone system: a short overview. 247-254 - Ghaïs El Zein, Mohamed Salehudin, Annie Daniel, Jin Jiang Bai, Jacques Citerne:
Experimental direct-sequence spred-spectrum digital mobile radio transmission. 255-268 - J. L. Dalmau, J. A. Delgado, Llorenç Huguet i Rotger, Inma Ortuño Ortin, R. Valle:
Concatenated coding schemes for HF channels. 269-278 - Christian Schlegel, Daniel J. Costello Jr.:
Bandwidth efficient coding on channels disturbed by jamming and impulse noise. 279-293 - Philippe R. Sadot, Jean-Luc Politano:
Errcr correcting coding scheme against partial time jammers. 294-300 - Paul Camion, Jean-Luc Politano:
Evaluation of a coding design for a very noisy channel. 301-311 - Charles Narçon:
Design and implementation of an asynchronous transmission process by code division multiple access. 312-322
Note and Problems
- Gerard Battail:
Is minimal distance a good criterion? 325-327 - Patrick Solé:
Covering radius of the circuit code. 328 - Patrick Solé:
Cyclic codes over rings and p-adic fields. 329
a service of 
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-04-22 21:12 CEST 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:
