Aimo Tietäväinen

Publication Activity (10 Years)

Years Active: 1977-2001
Publications (10 Years): 0

Publications

Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev
On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. IEEE Trans. Inf. Theory 47 (1) (2001)
Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev
On the Minimum Distances of Non-Binary Cyclic Codes. Des. Codes Cryptogr. 17 (1-3) (1999)
Iiro S. Honkala, Yrjö Kaipainen, Aimo Tietäväinen
Long binary narrow-sense BCH codes are normal. Appl. Algebra Eng. Commun. Comput. 8 (1) (1996)
Simon Litsyn, Aimo Tietäväinen
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. Eur. J. Comb. 17 (2-3) (1996)
Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen
On Algebraic Methods in Covering Radius Problems. AAECC (1995)
Simon Litsyn, Aimo Tietäväinen
Character Sum Constructions of Constrained Error-Correcting Codes. Appl. Algebra Eng. Commun. Comput. 5 (1994)
Hannu Tarnanen, Aimo Tietäväinen
A Simple Method to Estimate the Maximum Nontrivial Correlation of Some Sets of Sequences. Appl. Algebra Eng. Commun. Comput. 5 (1994)
Aimo Tietäväinen
On the cardinality of sets of sequences with given maximum correlation. Discret. Math. (1992)
Aimo Tietäväinen
On the Correlation fo Sequences. Algebraic Coding (1991)
Aimo Tietäväinen
Covering Radius and Dual Distance. Des. Codes Cryptogr. 1 (1) (1991)
Aimo Tietäväinen
An upper bound on the covering radius as a function of the dual distance. IEEE Trans. Inf. Theory 36 (6) (1990)
Aimo Tietäväinen
An asymptotic bound on the covering radii of binary BCH codes. IEEE Trans. Inf. Theory 36 (1) (1990)
Aimo Tietäväinen
Codes and character sums. Coding Theory and Applications (1988)
Aimo Tietäväinen
Bounds for Binary Codes Just Outside the Plotkin Range Inf. Control. 47 (2) (1980)
Aimo Tietäväinen
, e ⩾ 3. Discret. Math. 17 (2) (1977)