The SCEAS System
Navigation Menu

Conferences in DBLP

Coding Theory and Applications (coding)
1988 (conf/coding/1988)

  1. Aimo Tietäväinen
    Codes and character sums. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:3-12 [Conf]
  2. M. Carral, D. Rotillon, J. A. Thiong-Ly
    Codes from Artin-Schreier curves. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:13-27 [Conf]
  3. Marc Perret
    Families of codes exceeding the Varshamov-Gilbert bound. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:28-36 [Conf]
  4. Dominique Le Brigand
    Polynomial factorization using Brill-Noether algorithm. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:37-46 [Conf]
  5. Jacques Wolfmann
    New bounds on cyclic codes from algebraic curves. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:47-62 [Conf]
  6. Gilles Lachaud
    Exponential sums and the Carlitz-Uchiyama bound. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:63-75 [Conf]
  7. Philippe Piret
    Bounds on the use of the postal channel. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:79-90 [Conf]
  8. Sami Harari
    A new authentication algorithm. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:91-105 [Conf]
  9. Jacques Stern
    A method for finding codewords of small weight. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:106-113 [Conf]
  10. Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang
    Generating codewords in real space: Application to decoding. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:114-122 [Conf]
  11. Gerard Battail
    Weighted decoding of linear block codes by solving a system of implicit equations. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:123-133 [Conf]
  12. Rémi Sfez, J. C. Belfiore
    Suboptimum weighted-output symbol-by-symbol decoding of block codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:134-146 [Conf]
  13. Y. P. Zhu, Philippe Godlewski
    Results of generalized minimum distance decoding for block code of rate 1/2. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:147-161 [Conf]
  14. Henk C. A. van Tilborg
    An overview of recent results in the theory of burst-correcting codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:164-184 [Conf]
  15. J. A. Thiong-Ly
    Note for computing the minimum polynomied of elements in large finite fields. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:185-192 [Conf]
  16. Patrick Solé
    A quaternary cyclic code, and a family of quadriphase sequences with low correlation properties. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:193-201 [Conf]
  17. Claude Carlet
    A simple description of Kerdock codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:202-208 [Conf]
  18. Patrice Rabizzoni
    Relation between the minimum weight of a linear code over GF(qm) and its q-art image over GF(q). [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:209-212 [Conf]
  19. Arif Ghafoor, Patrick Solé
    Covering in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:213-225 [Conf]
  20. Jean François Maurras
    More on the plane of order 10. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:226-231 [Conf]
  21. Patrick Fitzpatrick, Graham H. Norton
    Linear recurrence relations and an extended subresultant algorithm. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:232-243 [Conf]
  22. Jean-Louis Dornstetter
    The future pan european mobile radiotelephone system: a short overview. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:247-254 [Conf]
  23. G. El Zein, M. Salehudin, A. Daniel, J. J. Bai, J. Citerne
    Experimental direct-sequence spred-spectrum digital mobile radio transmission. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:255-268 [Conf]
  24. J. L. Dalmau, J. A. Delgado, Llorenç Huguet i Rotger, Inma Ortuño Ortin, R. Valle
    Concatenated coding schemes for HF channels. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:269-278 [Conf]
  25. Christian Schlegel, Daniel J. Costello Jr.
    Bandwidth efficient coding on channels disturbed by jamming and impulse noise. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:279-293 [Conf]
  26. Philippe R. Sadot, Jean-Luc Politano
    Errcr correcting coding scheme against partial time jammers. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:294-300 [Conf]
  27. Paul Camion, Jean-Luc Politano
    Evaluation of a coding design for a very noisy channel. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:301-311 [Conf]
  28. Charles Narçon
    Design and implementation of an asynchronous transmission process by code division multiple access. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:312-322 [Conf]
  29. Gerard Battail
    Is minimal distance a good criterion? [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:325-327 [Conf]
  30. Patrick Solé
    Covering radius of the circuit code. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:328- [Conf]
  31. Patrick Solé
    Cyclic codes over rings and p-adic fields. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:329- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002