The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Antoine Lobstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
    On a conjecture concerning coverings of Hamming space. [Citation Graph (0, 0)][DBLP]
    AAECC, 1984, pp:79-89 [Conf]
  2. Antoine Lobstein, Patrick Solé
    Arithmetic Codes - Survey, Recent and New Results. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:246-258 [Conf]
  3. Antoine Lobstein
    On Modular Weights in Arithmetic Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:56-67 [Conf]
  4. Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor
    How to Improve an Exponentiation Black-Box. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:211-220 [Conf]
  5. Gregory Kabatianskii, Antoine Lobstein
    On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:263-269 [Conf]
  6. Antoine Lobstein, Vera Pless
    The Length Function: A Revised Table. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:51-55 [Conf]
  7. Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.
    Covering Radius 1985-1994. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:3, pp:173-239 [Journal]
  8. Antoine Lobstein, Victor Zinoviev
    On New Perfect Binary Nonlinear Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:5, pp:415-420 [Journal]
  9. Iiro S. Honkala, Antoine Lobstein
    On the complexity of the identification problem in Hamming spaces. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:11/12, pp:839-845 [Journal]
  10. Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
    General Bounds for Identifying Codes in Some Infinite Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  11. Irène Charon, Olivier Hudry, Antoine Lobstein
    Identifying Codes with Small Radius in Some Infinite Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  12. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    New Bounds for Codes Identifying Vertices in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  13. Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel
    A linear algorithm for minimum 1-identifying codes in oriented trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1246-1253 [Journal]
  14. Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
    The minimum density of an identifying code in the king lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:95-109 [Journal]
  15. Irène Charon, Olivier Hudry, Antoine Lobstein
    Extremal cardinalities for identifying and locating-dominating codes in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:356-366 [Journal]
  16. Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
    Identifying and locating-dominating codes on chains and cycles. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:7, pp:969-987 [Journal]
  17. Antoine Lobstein, Gérard D. Cohen
    Sur La Complexité D'un Problème De Codage. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:1, pp:25-32 [Journal]
  18. Iiro S. Honkala, Antoine Lobstein
    On Identifying Codes in Binary Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:2, pp:232-243 [Journal]
  19. Iiro S. Honkala, Antoine Lobstein
    On the Density of Identifying Codes in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:297-306 [Journal]
  20. Iiro S. Honkala, Antoine Lobstein
    On Identification in ZZ2 Using Translates of Given Patterns. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2003, v:9, n:10, pp:1204-1219 [Journal]
  21. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    Bounds for Codes Identifying Vertices in the Hexagonal Grid. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:492-504 [Journal]
  22. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:2, pp:174-176 [Journal]
  23. Irène Charon, Olivier Hudry, Antoine Lobstein
    Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2109-2120 [Journal]
  24. Sergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva
    Intersection matrices for partitions by binary perfect codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1621-1624 [Journal]
  25. Irène Charon, Olivier Hudry, Antoine Lobstein
    Identifying and locating-dominating codes: NP-Completeness results for directed graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2192-2200 [Journal]
  26. Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
    Further results on the covering radius of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:680-694 [Journal]
  27. Antoine Lobstein, Gerhard J. M. van Wee
    Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1498-0 [Journal]
  28. Antoine Lobstein
    Comments on 'A note on perfect arithmetic codes' by J. Astola. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:589-0 [Journal]
  29. Antoine Lobstein
    The hardness of solving subset sum with preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:943-0 [Journal]
  30. Antoine Lobstein, Gerhard J. M. van Wee
    On normal and subnormal q-ary codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1291-0 [Journal]
  31. Antoine Lobstein
    On perfect arithmetic codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:333-336 [Journal]

  32. Links Between Discriminating and Identifying Codes in the Binary Hamming Space. [Citation Graph (, )][DBLP]


  33. Structural Properties of Twin-Free Graphs. [Citation Graph (, )][DBLP]


  34. Watching Systems in graphs: an extension of Identifying Codes [Citation Graph (, )][DBLP]


  35. Discriminating codes in (bipartite) planar graphs. [Citation Graph (, )][DBLP]


  36. New identifying codes in the binary Hamming space. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.043secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002