Iiro S. Honkala

Olivier Hudry

Cryptogr. Commun., 2016

2015

On the ensemble of optimal dominating and locating-dominating codes in a graph.

[BibT_eX]

[DOI]

Olivier Hudry

Inf. Process. Lett., 2015

On the number of optimal identifying codes in a twin-free graph.

[BibT_eX]

[DOI]

Olivier Hudry

Discret. Appl. Math., 2015

2014

Minimum sizes of identifying codes in graphs differing by one edge.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2014

2013

Watching Systems in the King Grid.

[BibT_eX]

[DOI]

David Auger

Graphs Comb., 2013

Minimum sizes of identifying codes in graphs differing by one vertex.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2013

2012

Locally identifying colourings for graphs with given maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2012

2010

An Optimal Strongly Identifying Code in the Infinite Triangular Grid.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

On Vertex-Robust Identifying Codes of Level Three.

[BibT_eX]

Ars Comb., 2010

2009

Weighted perfect codes in Lee metric.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On r-locating-dominating sets in paths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Weighted codes in Lee metrics.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

Erratum.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

2008

On Identifying Codes in the King Grid that are Robust Against Edge Deletions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

On a new class of identifying codes in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On identifying codes that are robust against edge changes.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Structural Properties of Twin-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

On robust and dynamic identifying codes.

[BibT_eX]

[DOI]

Mark G. Karpovsky

Lev B. Levitin

IEEE Trans. Inf. Theory, 2006

A family of optimal identifying codes in Z<sup>2</sup>.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

On locating-dominating sets in infinite grids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

An optimal locating-dominating set in the infinite triangular grid.

[BibT_eX]

[DOI]

Discret. Math., 2006

On 2-edge robust r-identifying codes in the king grid.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

2005

Covering Codes.

[BibT_eX]

North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005

2004

On identifying codes in the triangular and square grids.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

On identification in the triangular grid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

On identifying codes in the hexagonal mesh.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

On Locating-Dominating Codes in Binary Hamming Spaces.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

The minimum density of an identifying code in the king lattice.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

On Identification in ZZ<sup>2</sup> Using Translates of Given Patterns.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2003

Codes for Identification in the King Lattice.

[BibT_eX]

[DOI]

Graphs Comb., 2003

On the Identification of Sets of Points in the Square Lattice.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.

[BibT_eX]

[DOI]

Mark G. Karpovsky

Discret. Appl. Math., 2003

2002

Two families of optimal identifying codes in binary Hamming spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Multicovering Bounds from Relative Covering Radii.

[BibT_eX]

[DOI]

Andrew Klapper

SIAM J. Discret. Math., 2002

On the Density of Identifying Codes in the Square Lattice.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

On Identifying Codes in Binary Hamming Spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

On strongly identifying codes.

[BibT_eX]

[DOI]

Discret. Math., 2002

Triple systems for identifying quadruples.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

On the complexity of the identification problem in Hamming spaces.

[BibT_eX]

[DOI]

Acta Informatica, 2002

2001

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2001

Codes for Strong Identification.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Bounds on identifying codes.

[BibT_eX]

[DOI]

Uri Blass

Discret. Math., 2001

On Codes Identifying Sets of Vertices in Hamming Spaces.

[BibT_eX]

Des. Codes Cryptogr., 2001

Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers.

[BibT_eX]

Andrew Klapper

Des. Codes Cryptogr., 2001

General Bounds for Identifying Codes in Some Infinite Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

On the Identification of Vertices and Edges Using Cycles.

[BibT_eX]

[DOI]

Mark G. Karpovsky

Proceedings of the Applied Algebra, 2001

2000

Bounds for Codes Identifying Vertices in the Hexagonal Grid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

1999

The probability of undetected error can have several local maxima.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On relations between covering radius and dual distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

New Bounds for Codes Identifying Vertices in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

On identifying codes.

[BibT_eX]

[DOI]

Proceedings of the Codes and Association Schemes, 1999

On tHe Size of Identifying Codes.

[BibT_eX]

[DOI]

Uri Blass

Proceedings of the Applied Algebra, 1999

1998

Combinatorial lower bounds on binary codes with covering radius one.

[BibT_eX]

Ars Comb., 1998

Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract).

[BibT_eX]

[DOI]

Andrew Klapper

Proceedings of the Sequences and their Applications, 1998

1997

Long packing and covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

On Covering Radius and Discrete Chebyshev Polynomials.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

1996

Long binary narrow-sense BCH codes are normal.

[BibT_eX]

[DOI]

Yrjö Kaipainen

Aimo Tietäväinen

Appl. Algebra Eng. Commun. Comput., 1996

1995

Weighted coverings and packings.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.

[BibT_eX]

[DOI]

Patric R. J. Östergård

SIAM J. Discret. Math., 1995

On Algebraic Methods in Covering Radius Problems.

[BibT_eX]

[DOI]

Aimo Tietäväinen

Proceedings of the Applied Algebra, 1995

1994

On the normality of multiple covering codes.

[BibT_eX]

[DOI]

Discret. Math., 1994

On (q, 1)-subnormal q-ary Covering Codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Normal and abnormal codes.

[BibT_eX]

[DOI]

Tuvi Etzion

Gadi Greenberg

IEEE Trans. Inf. Theory, 1993

Bounds for Binary Multiple Covering Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1993

A Lower Bound on Binary Codes with Covering Radius One.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

Some Features of Binary Block Codes for Correcting Asymmetric Errors.

[BibT_eX]

[DOI]

G. Fang

Henk C. A. van Tilborg

Feng-Wen Sun

Proceedings of the Applied Algebra, 1993

1992

On lengthening of covering codes.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Bounds for abnormal binary codes with covering radius one.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

On (k, t) -subnormal covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Modified bounds for coveting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

All binary codes with covering radius one are subnormal.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

Lower bounds for q-ary covering codes.

[BibT_eX]

[DOI]

Wende Chen

IEEE Trans. Inf. Theory, 1990

1988

A new construction for covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Lower bounds for binary covering codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

Some lower bounds for constant weight codes.

[BibT_eX]

[DOI]

Markku K. Kaikkonen

Discret. Appl. Math., 1987

1985

A modification of the Zinoviev lower bound for constant weight codes.

[BibT_eX]

[DOI]