Iiro Honkala
honkala@utu.fi +358 29 450 4301 +358 50 323 8539 Vesilinnantie 5 Turku |
- Bounds for codes identifying vertices in the hexagonal grid (2000)
- Siam Journal on Discrete Mathematics
- Multicovering bounds from relative covering radii (2000)
- IEEE International Symposium on Information Theory
- On binary codes for identification (2000)
- Journal of Combinatorial Designs
- On codes that call identify vertices in graphs (2000)
- IEEE International Symposium on Information Theory
- On the probability of undetected error (2000)
- IEEE International Symposium on Information Theory
- On the size of identifying codes (1999)
- Lecture Notes in Computer Science
- Combinatorial lower bounds on binary codes with covering radius one (1998)
- Ars Combinatoria
- Long binary narrow-sense BCH codes are normal (1997)
- Applicable Algebra in Engineering, Communication and Computing
- Long packing and covering codes (1997)
- IEEE Transactions on Information Theory
- On covering radius and discrete Chebyshev polynomials (1997)
- Applicable Algebra in Engineering, Communication and Computing
- FOOTBALL POOLS - A GAME FOR MATHEMATICIANS (1995)
- American Mathematical Monthly
- On algebraic methods in covering radius problems (1995)
- Lecture Notes in Computer Science
- Weighted coverings and packings (1995)
- IEEE Transactions on Information Theory
- ON (Q,1)-SUBNORMAL Q-ARY COVERING CODES (1994)
- Discrete Applied Mathematics
- ON THE NORMALITY OF MULTIPLE COVERING CODES (1994)
- Discrete Mathematics
- ON LENGTHENING OF COVERING CODES (1992)
- Discrete Mathematics
- ALL BINARY-CODES WITH COVERING RADIUS ONE ARE SUBNORMAL (1991)
- Discrete Mathematics
- SOME LOWER BOUNDS FOR CONSTANT WEIGHT CODES (1987)
- Discrete Applied Mathematics
- A MODIFICATION OF THE ZINOVIEV LOWER BOUND FOR CONSTANT WEIGHT CODES (1985)
- Discrete Applied Mathematics
- SOME OPTIMAL CONSTANT WEIGHT CODES (1985)
- Ars Combinatoria