Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 2012950 results
Sort by: relevance publication year

Long packing and covering codes

JOURNAL ARTICLE published 1997 in IEEE Transactions on Information Theory

Authors: G. Cohen | I. Honkala | S. Litsyn | P. Sole

https://doi.org/10.1109/18.623161 Actions

On codes that can identify vertices in graphs

PROCEEDINGS ARTICLE published in 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)

Authors: G. Cohen | I. Honkala | A. Lobstein | G. Zemor

https://doi.org/10.1109/isit.2000.866301 Actions

On identifying codes

BOOK CHAPTER published 13 February 2001 in Codes and Association Schemes

Authors: Gérard Cohen | Iiro Honkala | Antoine Lobstein | Gilles Zémor

https://doi.org/10.1090/dimacs/056/07 Actions

New Bounds for Codes Identifying Vertices in Graphs

JOURNAL ARTICLE published 15 March 1999 in The Electronic Journal of Combinatorics

Authors: Gérard Cohen | Iiro Honkala | Antoine Lobstein | Gilles Zémor

https://doi.org/10.37236/1451 Actions

On codes identifying vertices in the two-dimensional square lattice with diagonals

JOURNAL ARTICLE published 2001 in IEEE Transactions on Computers

Authors: G.D. Cohen | L. Honkala | A. Lobstein

https://doi.org/10.1109/12.908992 Actions

Bounds for Codes Identifying Vertices in the Hexagonal Grid

JOURNAL ARTICLE published January 2000 in SIAM Journal on Discrete Mathematics

Authors: Gérard D. Cohen | Iiro Honkala | Antoine Lobstein | Gilles Zémor

https://doi.org/10.1137/s0895480199360990 Actions

Further results on the covering radius of codes

JOURNAL ARTICLE published September 1986 in IEEE Transactions on Information Theory

Authors: G. Cohen | A. Lobstein | N. Sloane

https://doi.org/10.1109/tit.1986.1057227 Actions

On lengthening of covering codes

JOURNAL ARTICLE published September 1992 in Discrete Mathematics

Authors: Iiro Honkala

https://doi.org/10.1016/0012-365x(92)90556-u Actions

Constructing covering codes via noising

PROCEEDINGS ARTICLE published in Proceedings of 1995 IEEE International Symposium on Information Theory

Authors: I. Charon | O. Hudry | A. Lobstein

https://doi.org/10.1109/isit.1995.535757 Actions

General Bounds for Identifying Codes in Some Infinite Regular Graphs

JOURNAL ARTICLE published 14 November 2001 in The Electronic Journal of Combinatorics

Authors: Irène Charon | Iiro Honkala | Olivier Hudry | Antoine Lobstein

https://doi.org/10.37236/1583 Actions

On the normality of multiple covering codes

JOURNAL ARTICLE published February 1994 in Discrete Mathematics

Authors: Iiro Honkala

https://doi.org/10.1016/0012-365x(94)90164-3 Actions

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

JOURNAL ARTICLE published January 2015 in Discrete Applied Mathematics

Authors: Iiro Honkala | Olivier Hudry | Antoine Lobstein

https://doi.org/10.1016/j.dam.2014.08.020 Actions

On Identifying Codes in Binary Hamming Spaces

JOURNAL ARTICLE published August 2002 in Journal of Combinatorial Theory, Series A

Authors: Iiro Honkala | Antoine Lobstein

https://doi.org/10.1006/jcta.2002.3263 Actions

All binary codes with covering radius one are subnormal

JOURNAL ARTICLE published November 1991 in Discrete Mathematics

Authors: Iiro Honkala

https://doi.org/10.1016/0012-365x(91)90028-z Actions

Covering radius 1985-1994

PROCEEDINGS ARTICLE published in Proceedings of 1995 IEEE International Symposium on Information Theory

Authors: G.D. Cohen | S. Litsyn | A. Lobstein | H.F. Mattson

https://doi.org/10.1109/isit.1995.535749 Actions

Modified bounds for covering codes

JOURNAL ARTICLE published March 1991 in IEEE Transactions on Information Theory

Authors: I.S. Honkala

https://doi.org/10.1109/18.75253 Actions

On (q, 1)-subnormal q-ary covering codes

JOURNAL ARTICLE published August 1994 in Discrete Applied Mathematics

Authors: Iiro Honkala

https://doi.org/10.1016/0166-218x(94)90141-4 Actions

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

JOURNAL ARTICLE published September 2015 in Information Processing Letters

Authors: Iiro Honkala | Olivier Hudry | Antoine Lobstein

https://doi.org/10.1016/j.ipl.2015.04.005 Actions

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

JOURNAL ARTICLE published January 2016 in Cryptography and Communications

Authors: Iiro Honkala | Olivier Hudry | Antoine Lobstein

https://doi.org/10.1007/s12095-015-0148-3 Actions

Minimum sizes of identifying codes in graphs differing by one edge

JOURNAL ARTICLE published June 2014 in Cryptography and Communications

Authors: Irène Charon | Iiro Honkala | Olivier Hudry | Antoine Lobstein

https://doi.org/10.1007/s12095-013-0094-x Actions
Feedback: support@crossref.org