2020
Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019.
Appl. Algebra Eng. Commun. Comput., 2020
2016
On the ensemble of optimal identifying codes in a twin-free graph.
Cryptogr. Commun., 2016
2015
On the ensemble of optimal dominating and locating-dominating codes in a graph.
Inf. Process. Lett., 2015
On the number of optimal identifying codes in a twin-free graph.
Discret. Appl. Math., 2015
2014
Minimum sizes of identifying codes in graphs differing by one edge.
Cryptogr. Commun., 2014
2013
Watching Systems in the King Grid.
Graphs Comb., 2013
Minimum sizes of identifying codes in graphs differing by one vertex.
Cryptogr. Commun., 2013
2012
Locally identifying colourings for graphs with given maximum degree.
Discret. Math., 2012
2010
An Optimal Strongly Identifying Code in the Infinite Triangular Grid.
Electron. J. Comb., 2010
On Vertex-Robust Identifying Codes of Level Three.
Ars Comb., 2010
2009
Weighted perfect codes in Lee metric.
Electron. Notes Discret. Math., 2009
On r-locating-dominating sets in paths.
Eur. J. Comb., 2009
Weighted codes in Lee metrics.
Des. Codes Cryptogr., 2009
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Adv. Math. Commun., 2009
2008
On Identifying Codes in the King Grid that are Robust Against Edge Deletions.
Electron. J. Comb., 2008
2007
On a new class of identifying codes in graphs.
Inf. Process. Lett., 2007
On identifying codes that are robust against edge changes.
Inf. Comput., 2007
Structural Properties of Twin-Free Graphs.
Electron. J. Comb., 2007
2006
On robust and dynamic identifying codes.
IEEE Trans. Inf. Theory, 2006
A family of optimal identifying codes in Z<sup>2</sup>.
J. Comb. Theory, Ser. A, 2006
On locating-dominating sets in infinite grids.
Eur. J. Comb., 2006
An optimal locating-dominating set in the infinite triangular grid.
Discret. Math., 2006
On 2-edge robust r-identifying codes in the king grid.
Australas. J Comb., 2006
2005
North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005
2004
On identifying codes in the triangular and square grids.
SIAM J. Comput., 2004
On identification in the triangular grid.
J. Comb. Theory, Ser. B, 2004
On identifying codes in the hexagonal mesh.
Inf. Process. Lett., 2004
On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci., 2004
The minimum density of an identifying code in the king lattice.
Discret. Math., 2004
2003
On Identification in ZZ<sup>2</sup> Using Translates of Given Patterns.
J. Univers. Comput. Sci., 2003
Codes for Identification in the King Lattice.
Graphs Comb., 2003
On the Identification of Sets of Points in the Square Lattice.
Discret. Comput. Geom., 2003
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discret. Appl. Math., 2003
2002
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory, 2002
Multicovering Bounds from Relative Covering Radii.
SIAM J. Discret. Math., 2002
On the Density of Identifying Codes in the Square Lattice.
J. Comb. Theory, Ser. B, 2002
On Identifying Codes in Binary Hamming Spaces.
J. Comb. Theory, Ser. A, 2002
On strongly identifying codes.
Discret. Math., 2002
Triple systems for identifying quadruples.
Australas. J Comb., 2002
On the complexity of the identification problem in Hamming spaces.
Acta Informatica, 2002
2001
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers, 2001
Codes for Strong Identification.
Electron. Notes Discret. Math., 2001
Bounds on identifying codes.
Discret. Math., 2001
On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr., 2001
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers.
Des. Codes Cryptogr., 2001
General Bounds for Identifying Codes in Some Infinite Regular Graphs.
Electron. J. Comb., 2001
On the Identification of Vertices and Edges Using Cycles.
Proceedings of the Applied Algebra, 2001
2000
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discret. Math., 2000
1999
The probability of undetected error can have several local maxima.
IEEE Trans. Inf. Theory, 1999
On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory, 1999
New Bounds for Codes Identifying Vertices in Graphs.
Electron. J. Comb., 1999
Proceedings of the Codes and Association Schemes, 1999
On tHe Size of Identifying Codes.
Proceedings of the Applied Algebra, 1999
1998
Combinatorial lower bounds on binary codes with covering radius one.
Ars Comb., 1998
Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract).
Proceedings of the Sequences and their Applications, 1998
1997
Long packing and covering codes.
IEEE Trans. Inf. Theory, 1997
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput., 1997
1996
Long binary narrow-sense BCH codes are normal.
Appl. Algebra Eng. Commun. Comput., 1996
1995
Weighted coverings and packings.
IEEE Trans. Inf. Theory, 1995
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discret. Math., 1995
On Algebraic Methods in Covering Radius Problems.
Proceedings of the Applied Algebra, 1995
1994
On the normality of multiple covering codes.
Discret. Math., 1994
On (q, 1)-subnormal q-ary Covering Codes.
Discret. Appl. Math., 1994
1993
Normal and abnormal codes.
IEEE Trans. Inf. Theory, 1993
Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptogr., 1993
A Lower Bound on Binary Codes with Covering Radius One.
Proceedings of the Algebraic Coding, 1993
Some Features of Binary Block Codes for Correcting Asymmetric Errors.
Proceedings of the Applied Algebra, 1993
1992
On lengthening of covering codes.
Discret. Math., 1992
1991
Bounds for abnormal binary codes with covering radius one.
IEEE Trans. Inf. Theory, 1991
On (k, t) -subnormal covering codes.
IEEE Trans. Inf. Theory, 1991
Modified bounds for coveting codes.
IEEE Trans. Inf. Theory, 1991
All binary codes with covering radius one are subnormal.
Discret. Math., 1991
1990
Lower bounds for q-ary covering codes.
IEEE Trans. Inf. Theory, 1990
1988
A new construction for covering codes.
IEEE Trans. Inf. Theory, 1988
Lower bounds for binary covering codes.
IEEE Trans. Inf. Theory, 1988
1987
Some lower bounds for constant weight codes.
Discret. Appl. Math., 1987
1985
A modification of the Zinoviev lower bound for constant weight codes.
Discret. Appl. Math., 1985
