The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Toby Berger
    Information Theory in Random Fields. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:1-18 [Conf]
  2. James L. Massey, Thomas Schaub
    Linear Complexity in Coding Theory. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:19-32 [Conf]
  3. Gilbert Roux
    K-Permutivity. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:33-38 [Conf]
  4. M. Beveraggi, Gérard D. Cohen
    On the Density of Best Coverings in Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:39-44 [Conf]
  5. Patrick Solé
    The Lee Association Scheme. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:45-55 [Conf]
  6. Antoine Lobstein
    On Modular Weights in Arithmetic Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:56-67 [Conf]
  7. Toby Berger, Raymond W. Yeung
    Optimum '1'-Ended Binary Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:68-75 [Conf]
  8. Herman Akdag, Bernadette Bouchon
    Optimality of Right Leaning Trees. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:76-85 [Conf]
  9. Anne Bertrand
    Specification, Synchronisation, Average Length. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:86-95 [Conf]
  10. Yves Driencourt, Jean-Francis Michon
    Amerlioration of the Mc Williams-Sloanes Tables using Geometric Codes from Curves with Genus 1, 2 or 3. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:96-105 [Conf]
  11. Dominique Le Brigand
    A [32, 17, 14] - Geometric Code coming from a Singular Curve. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:106-115 [Conf]
  12. I. M. Chakravarti
    The Generalized Goppa Codes and Related Discrete Designs from Hermitian Surfaces in PG (3, s2). [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:116-124 [Conf]
  13. Gilles Lachaud
    Projective Reed - Muller Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:125-129 [Conf]
  14. Marc Rouanne, Daniel J. Costello Jr.
    A Lower Bound on the Minimum Euclidean Distance of Trellis Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:130-140 [Conf]
  15. J. Fang, Gérard D. Cohen, Philippe Godlewski, Gerard Battail
    On the Inherent Intractability of Soft Decision Decoding of Linear Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:141-149 [Conf]
  16. Gerard Battail
    Weighted Decoding as a Means for Reestimating a Probability Distribution (Abstract). [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:150-153 [Conf]
  17. J. C. Belfiore
    A Weighted-Output Symbol-by-Symbol Decoding Algorithm of Binary Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:154-158 [Conf]
  18. Roger Alexis
    Search for Sequences with Zero Autocorrelation. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:159-172 [Conf]
  19. G. Hakizimana, G. Jourdain, G. Loubet
    Adapted Codes for Communication Through Multipath Channel. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:173-182 [Conf]
  20. Francisco J. García-Ugalde
    Coding and Decoding Algorithms of Reed - Solomon Codes Executed on a M 68000 Microprocessor. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:183-196 [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