The journal papers of the Coding Theory Group 2001-
- Honkala, Iiro, An optimal strongly identifying code in the infinite triangular grid. Electron. J. Combin. 17 (2010), no. 1, Research Paper 91, 10 pp,
- Honkala, Iiro; Laihonen, Tero, On vertex-robust identifying codes of level three. Ars Combin. 94 (2010), 115–127.
- G. Exoo, V. Junnila and T. Laihonen, Locating-dominating codes in cycles, Australasian Journal of Combinatorics, to appear.
- G. Exoo, V. Junnila and T. Laihonen, On location-domination of set of vertices in cycles and paths, Congr. Numer., to appear.
- S. Ranto, On binary linear r-identifying codes, Des. Codes Cryptogr., to appear.
- H.-F. Lu and C. Hollanti, Optimal diversity multiplexing tradeoff and code constructions of constrained asymmetric MIMO systems, IEEE Trans. on Inform. Theory, 55(5), 2010.
- R. Vehkalahti, The Coding Gain of Real Matrix Lattices: Bounds and Existence Results, IEEE Trans. Inf. Theory, 56(9), pp. 4359-4366, 2010.
- David Auger, Irène Charon, Iiro Honkala, Olivier Hudry and Antoine Lobstein: Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs, Advances in Mathematics of Communications 3 (2009) 97-114.
- Uri Blass, Iiro Honkala, Mark Karpovsky, Simon Litsyn: Short dominating paths and cycles in the binary hypercube, Annals of Combinatorics 5 (2001) 51-59.
- Uri Blass, Iiro Honkala, Simon Litsyn: Bounds on identifying codes, Discrete Mathematics 241 (2001) 119-128.
- Irene Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: General bounds for identifying codes in some infinite regular graphs, Electronic Journal of Combinatorics 8(1) (2001), R39.
- Irene Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, 276 (2004) 95-109.
- Irene Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein: Structural properties of twin-free graphs. Electronic Journal of Combinatorics 14(1) (2007) R16.
- Gérard Cohen, Iiro Honkala, Antoine Lobstein, Gilles Zémor: On codes identifying vertices in the two-dimensional square lattice with diagonals, IEEE Transactions on Computers 50 (2001) 174-176.
- Hans Dobbertin, Patrick Felke, Tor Helleseth, Petri Rosendahl: Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums. IEEE Transactions on Information Theory 52 (2006) 613-627.
- Paul Dorbec, Sylvain Gravier, Iiro Honkala and Michel Mollard: Weighted codes in Lee metrics, Designs, Codes and Cryptography 52 (2009) 209-218.
- Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto: Locating vertices using codes. Congressus Numerantium 191 (2008) 143-159.
- Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto: Upper bounds for binary identifying codes. Advances in Applied Mathematics 42 (2009) 277-289.
- Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto: Improved bounds on identifying codes in binary Hamming spaces. European Journal of Combinatorics 31 (2010) 813-827.
- Geoffrey Exoo, Tero Laihonen, Sanna Ranto: Improved upper bounds on binary identifying codes. IEEE Transactions on Information Theory 53 (2007) 4255-4260.
- Geoffrey Exoo, Tero Laihonen, Sanna Ranto: New bounds on binary identifying codes, Discrete Applied Mathematics 156 (2008) 2250-2262.
- Tor Helleseth, Petri Rosendahl: New pairs of m-sequences with 4-level cross-correlation, Finite Fields and Their Applications 11 (2005) 674-683.
- Tor Helleseth, Jyrki Lahtonen, Petri Rosendahl: On Niho type cross-correlation functions of m-sequences, Finite Fields and Their Applications 13 (2007), no. 2, 305-317.
- Tor Helleseth, Jyrki Lahtonen, Kalle Ranto: A simple proof to the minimum distance of Z4-linear Goethals-like codes, Journal of Complexity 20 (2004) 297-304.
- Camilla Hollanti, Jyrki Lahtonen, Hsiao-Feng Lu: Maximal orders in the design of dense space-time lattice codes, IEEE Transactions on Information Theory 54 (2008) 4493-4510.
- Camilla Hollanti, Hsiao-Feng Lu: Construction methods for asymmetric and multiblock space-time codes, IEEE Transactions on Information Theory 55 (2009) 1086-1103.
- Iiro Honkala: Triple systems for identifying quadruples, Australasian Journal of Combinatorics 25 (2002) 303-316.
- Iiro Honkala: An optimal robust identifying code in the triangular lattice, Annals of Combinatorics 8 (2004) 303-323.
- Iiro Honkala: A family of optimal identifying codes in Z2, Journal of Combinatorial Theory A 113 (2006) 1760-1763.
- Iiro Honkala: An optimal locating-dominating set in the infinite triangular grid, Discrete Mathematics 306 (2006) 2670-2681.
- Iiro Honkala: On 2-edge-robust r-identifying codes in the king grid. Australasian Journal of Combinatorics 36 (2006) 151-165.
- Iiro Honkala: On r-locating-dominating sets in paths. European Journal of Combinatorics 30 (2009) 1022-1025.
- Iiro Honkala, Mark Karpovsky, Simon Litsyn: Cycles for identifying vertices and edges in binary hypercube and 2-dimensional tori, Discrete Applied Mathematics 129 (2003) 409-419.
- Iiro Honkala, Mark Karpovsky, Lev Levitin: On robust and dynamic identifying codes, IEEE Transactions on Information Theory, IEEE Transactions on Information Theory 52 (2006) 599-612
- Iiro Honkala, Andrew Klapper: Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers, Designs, Codes and Cryptography 23 (2001) 131-145.
- Iiro Honkala, Andrew Klapper: Multicovering bounds from relative covering radii, SIAM J. Discrete Math. 15 (2002) 228-234.
- Iiro Honkala, Tero Laihonen, Sanna Ranto: On codes identifying sets of vertices in Hamming spaces, Designs, Codes and Cryptography, 24 (2001) 193-204.
- Iiro Honkala, Tero Laihonen: On the probability of undetected error for binary codes used for combined correction and detection, Journal of Discrete Mathematical Sciences & Cryptography 4 (2001) 189-197.
- Iiro Honkala, Tero Laihonen, Sanna Ranto: On strongly identifying codes, Discrete Mathematics 254 (2002) 191-205.
- Iiro Honkala, Tero Laihonen: On the identification of sets of points in the square lattice, Discrete and Computational Geometry, 29 (2003) 139-152.
- Iiro Honkala, Tero Laihonen: Codes for identification in the king lattice, Graphs and Combinatorics 19 (2003) 505-516.
- Iiro Honkala, Tero Laihonen: On identification in the triangular grid, Journal of Combinatorial Theory B 91 (2004) 67-86.
- Iiro Honkala, Tero Laihonen: On identifying codes in the triangular and square grids, SIAM Journal on Computing 33 (2004) 304-312.
- Iiro Honkala, Tero Laihonen: On identifying codes in the hexagonal mesh, Information Processing Letters 89 (2004) 9-14.
- Iiro Honkala, Tero Laihonen: On locating-dominating sets in infinite grids, European Journal of Combinatorics 27 (2006) 218-227.
- Iiro Honkala, Tero Laihonen: On a new class of identifying codes in graphs, Information Processing Letters 102 (2007) 92-98.
- Iiro Honkala, Tero Laihonen: On identifying codes that are robust against edge changes, Information and Computation 205 (2007) 1078-1095.
- Iiro Honkala, Tero Laihonen: On identifying codes in the king grid that are robust against edge deletions, Electronic Journal of Combinatorics 15 (2008) R3.
- Iiro Honkala, Tero Laihonen: On vertex-robust identifying codes of level three, Ars Combinatoria, to appear.
- Iiro Honkala, Tero Laihonen, Sanna Ranto: On locating-dominating codes in binary Hamming spaces, Journal of Discrete Mathematics and Theoretical Computer Science 6 (2004) 265-282.
- Iiro Honkala, Antoine Lobstein: On the density of identifying codes in the square lattice, Journal of Combinatorial Theory (B) 85 (2002) 297-306.
- Iiro Honkala, Antoine Lobstein: On identifying codes in binary Hamming spaces, Journal of Combinatorial Theory (A) 99 (2002) 232-243.
- Iiro Honkala, Antoine Lobstein: On the complexity of the identification problem in Hamming spaces, Acta Informatica 38 (2002) 839-845.
- Iiro Honkala, Antoine Lobstein: On identification in Z2 using translates of given patterns, Journal of Universal Computer Science 9 (2003) 1204-1219.
- Svante Janson, Tero Laihonen: On the size of identifying codes in binary hypercubes, J. Combin. Theory Ser. A 116 (2009) no. 5, 1087-1096.
- Markku K. Kaikkonen, Petri Rosendahl: New covering codes from an ADS-like construction, IEEE Transactions on Information Theory 49 (2003) 1809-1812.
- Jyrki Lahtonen, San Ling, Patrick Solé, Dmitri Zinoview: Z8 Kerdock codes and pseudorandom binary sequences, Journal of Complexity 20 (2004) 318-330.
- Jyrki Lahtonen, Nadya Markin, Gary McGuire: Construction of multi-block space-time codes from division algebras with roots of unity as non-norm elements, IEEE Transactions on Information Theory 54 (2008) 5231-5235.
- Jyrki Lahtonen, Gary McGuire, Harold N. Ward: Gold and Kasami-Welch functions, quadratic forms, and bent functions, Advances in Mathematics of Communications 1 (2007), 243-250.
- Jyrki Lahtonen, Kalle Ranto, Roope Vehkalahti: 3-designs from all Z4-Goethals-like codes with block size 7 and 8. Finite Fields and Their Applications 13 (2007) 815-827.
- Tero Laihonen: Sequences of optimal identifying codes, IEEE Transactions on Information Theory 48 (2002) 774-776.
- Tero Laihonen: Optimal codes for strong identification, European Journal of Combinatorics 23 (2002) 307-313.
- Tero Laihonen: On optimal edge-robust and vertex-robust (1, ≤ l)-identifying codes, SIAM Journal on Discrete Mathematics 18 (2005) 825-834.
- Tero Laihonen: Optimal t-edge-robust r-identifying codes in the king lattice, Graphs and Combinatorics, 22 (2006) 487-496.
- Tero Laihonen: On robust identification in the square and king grids, Discrete Applied Mathematics 154 (2006) 2499-2510.
- Tero Laihonen: On edge-robust (1, ≤ l)-identifying codes in binary Hamming spaces, International Journal of Pure and Applied Mathematics 36 (2007) 87-102.
- Tero Laihonen: On cages admitting identifying codes, European Journal of Combinatorics, 29 (2008) 737-741.
- Tero Laihonen, Julien Moncel: On graphs admitting t-ID codes. Australian Journal of Combinatorics 40 (2008) 81-92.
- Tero Laihonen, Sanna Ranto: Families of optimal codes for strong identification, Discrete Applied Mathematics 121 (2002) 203-213.
- Hsiao-Feng Lu, Camilla Hollanti: Optimal diversity multiplexing tradeoff and code constructions of constrained asymmetric MIMO systems, IEEE Transactions on Information Theory, 55(5), 2010.
- Hsiao-Feng Lu, Roope Vehkalahti, Camilla Hollanti, Jyrki Lahtonen, Yi Hong, Emanuele Viterbo: New space-time code constructions for two-user multiple access channels, IEEE Journal on Special Topics in Signal Processing: Managing Complexity in Multi-user MIMO Systems 3 (2009) 939-957.
- Marko Moisio, Kalle Ranto: Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros. Finite Fields and their Applications 13 (2007) 922--935.
- Marko Moisio, Kalle Ranto: Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed. Finite Fields and Their Applications, 14 (2008) 798-815.
- Mikko Pelto: New Bounds for (r, ≤ 2)-Identifying Codes in the Infinite King Grid, Cryptography and Communications 2(1) (2010) 41-47.
- Kalle Ranto: Infinite families of 3-designs from Z4-linear Goethals-like codes with block size 8, SIAM Journal on Discrete Mathematics 15 (2002) 289-304.
- Kalle Ranto, Petri Rosendahl: On four-valued Niho-type cross-correlation functions of m-sequences, IEEE Transactions on Information Theory 52 (2006) 5533-5536.
- Sanna Ranto: Optimal linear identifying codes, IEEE Transactions on Information Theory 49 (2003) 1544-1547.
- Sanna Ranto, Iiro Honkala, Tero Laihonen: Two optimal families of binary identifying codes, IEEE Transactions on Information Theory 48 (2002) 1200-1203.
- Petri Rosendahl: On the identification of vertices using cycles, Electronic Journal of Combinatorics 10 (2003) R7.
- Petri Rosendahl: On the identifcation problems in products of cycles, Discrete Mathematics 275 (2004) 277-288.
- Petri Rosendahl: A generalization of Niho's Theorem, Designs, Codes and Cryptography, 38 (2006) 331-336.
- Roope Vehkalahti, Camilla Hollanti, Jyrki Lahtonen, Kalle Ranto: On the densest MIMO lattices from cyclic division algebras, IEEE Transactions on Information Theory 55 (2009) 3751-3780.
Last modified: