Nonexistence of nontrivial perfect codes in case q = pr1p12, e ⩾ 3. - Aimo Tietäväinen (Discret. Math., 1977)

Bounds for Binary Codes Just Outside the Plotkin Range - Aimo Tietäväinen (Inf. Control., 1980)

Codes and character sums. - Aimo Tietäväinen (Coding Theory and Applications, 1988)

An asymptotic bound on the covering radii of binary BCH codes. - Aimo Tietäväinen (IEEE Trans. Inf. Theory, 1990)

An upper bound on the covering radius as a function of the dual distance. - Aimo Tietäväinen (IEEE Trans. Inf. Theory, 1990)

On the Correlation fo Sequences. - Aimo Tietäväinen (Algebraic Coding, 1991)

Covering Radius and Dual Distance. - Aimo Tietäväinen (Des. Codes Cryptogr., 1991)

On the cardinality of sets of sequences with given maximum correlation. - Aimo Tietäväinen (Discret. Math., 1992)

Character Sum Constructions of Constrained Error-Correcting Codes. - Simon Litsyn; Aimo Tietäväinen (Appl. Algebra Eng. Commun. Comput., 1994)

A Simple Method to Estimate the Maximum Nontrivial Correlation of Some Sets of Sequences. - Hannu Tarnanen; Aimo Tietäväinen (Appl. Algebra Eng. Commun. Comput., 1994)

On Algebraic Methods in Covering Radius Problems. - Iiro S. Honkala; Simon Litsyn; Aimo Tietäväinen (AAECC, 1995)

Long binary narrow-sense BCH codes are normal. - Iiro S. Honkala; Yrjö Kaipainen; Aimo Tietäväinen (Appl. Algebra Eng. Commun. Comput., 1996)

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. - Simon Litsyn; Aimo Tietäväinen (Eur. J. Comb., 1996)

On the Minimum Distances of Non-Binary Cyclic Codes. - Pascale Charpin; Aimo Tietäväinen; Victor A. Zinoviev (Des. Codes Cryptogr., 1999)

On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. - Pascale Charpin; Aimo Tietäväinen; Victor A. Zinoviev (IEEE Trans. Inf. Theory, 2001)