Aimo Tietäväinen

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