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