Aimo Tietäväinen

According to our database, Aimo Tietäväinen authored at least 15 papers between 1977 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

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

1999

On the Minimum Distances of Non-Binary Cyclic Codes.

Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev

Des. Codes Cryptogr., 1999

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

Long binary narrow-sense BCH codes are normal.

Iiro S. Honkala, Yrjö Kaipainen, Aimo Tietäväinen

Appl. Algebra Eng. Commun. Comput., 1996

1995

On Algebraic Methods in Covering Radius Problems.

Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen

Proceedings of the Applied Algebra, 1995

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

Character Sum Constructions of Constrained Error-Correcting Codes.

Simon Litsyn, Aimo Tietäväinen

Appl. Algebra Eng. Commun. Comput., 1994

1992

On the cardinality of sets of sequences with given maximum correlation.

Aimo Tietäväinen

Discret. Math., 1992

1991

Covering Radius and Dual Distance.

Aimo Tietäväinen

Des. Codes Cryptogr., 1991

On the Correlation fo Sequences.

Aimo Tietäväinen

Proceedings of the Algebraic Coding, 1991

1990

An upper bound on the covering radius as a function of the dual distance.

Aimo Tietäväinen

IEEE Trans. Inf. Theory, 1990

An asymptotic bound on the covering radii of binary BCH codes.

Aimo Tietäväinen

IEEE Trans. Inf. Theory, 1990

1988

Codes and character sums.

Aimo Tietäväinen

Proceedings of the Coding Theory and Applications, 1988

1980

Bounds for Binary Codes Just Outside the Plotkin Range

Aimo Tietäväinen

Inf. Control., November, 1980

1977

Nonexistence of nontrivial perfect codes in case q = p^r₁p¹₂, e ⩾ 3.

Aimo Tietäväinen

Discret. Math., 1977