2001 |
14 | | Pascale Charpin,
Aimo Tietäväinen,
Victor Zinoviev:
On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property.
IEEE Transactions on Information Theory 47(1): 421-425 (2001) |
1999 |
13 | | Pascale Charpin,
Aimo Tietäväinen,
Victor Zinoviev:
On the Minimum Distances of Non-Binary Cyclic Codes.
Des. Codes Cryptography 17(1-3): 81-85 (1999) |
1996 |
12 | EE | Iiro S. Honkala,
Yrjö Kaipainen,
Aimo Tietäväinen:
Long Binary Narrow-Sense BCH Codes Are Normal.
Appl. Algebra Eng. Commun. Comput. 8(1): 49-55 (1996) |
11 | EE | 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): 265-270 (1996) |
1995 |
10 | | Iiro S. Honkala,
Simon Litsyn,
Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems.
AAECC 1995: 21-32 |
1994 |
9 | | 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: 123-128 (1994) |
8 | | Simon Litsyn,
Aimo Tietäväinen:
Character Sum Constructions of Constrained Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput. 5: 45-51 (1994) |
1992 |
7 | EE | Aimo Tietäväinen:
On the cardinality of sets of sequences with given maximum correlation.
Discrete Mathematics 106-107: 471-477 (1992) |
1991 |
6 | | Aimo Tietäväinen:
On the Correlation fo Sequences.
Algebraic Coding 1991: 1-4 |
5 | | Aimo Tietäväinen:
Covering Radius and Dual Distance.
Des. Codes Cryptography 1(1): 31-46 (1991) |
1990 |
4 | | Aimo Tietäväinen:
An asymptotic bound on the covering radii of binary BCH codes.
IEEE Transactions on Information Theory 36(1): 211- (1990) |
3 | | Aimo Tietäväinen:
An upper bound on the covering radius as a function of the dual distance.
IEEE Transactions on Information Theory 36(6): 1472- (1990) |
1988 |
2 | | Aimo Tietäväinen:
Codes and character sums.
Coding Theory and Applications 1988: 3-12 |
1980 |
1 | | Aimo Tietäväinen:
Bounds for Binary Codes Just Outside the Plotkin Range
Information and Control 47(2): 85-93 (1980) |