default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAimo Tietäväinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j12]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): 421-425 (2001)
1990 – 1999
- 1999
- [j11]Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev:
On the Minimum Distances of Non-Binary Cyclic Codes. Des. Codes Cryptogr. 17(1-3): 81-85 (1999) - 1996
- [j10]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) - [j9]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
- [c3]Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems. AAECC 1995: 21-32 - 1994
- [j8]Simon Litsyn, Aimo Tietäväinen:
Character Sum Constructions of Constrained Error-Correcting Codes. Appl. Algebra Eng. Commun. Comput. 5: 45-51 (1994) - [j7]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) - 1992
- [j6]Aimo Tietäväinen:
On the cardinality of sets of sequences with given maximum correlation. Discret. Math. 106-107: 471-477 (1992) - 1991
- [j5]Aimo Tietäväinen:
Covering Radius and Dual Distance. Des. Codes Cryptogr. 1(1): 31-46 (1991) - [c2]Aimo Tietäväinen:
On the Correlation fo Sequences. Algebraic Coding 1991: 1-4 - 1990
- [j4]Aimo Tietäväinen:
An asymptotic bound on the covering radii of binary BCH codes. IEEE Trans. Inf. Theory 36(1): 211-213 (1990) - [j3]Aimo Tietäväinen:
An upper bound on the covering radius as a function of the dual distance. IEEE Trans. Inf. Theory 36(6): 1472-1474 (1990)
1980 – 1989
- 1988
- [c1]Aimo Tietäväinen:
Codes and character sums. Coding Theory and Applications 1988: 3-12 - 1980
- [j2]Aimo Tietäväinen:
Bounds for Binary Codes Just Outside the Plotkin Range. Inf. Control. 47(2): 85-93 (1980)
1970 – 1979
- 1977
- [j1]Aimo Tietäväinen:
Nonexistence of nontrivial perfect codes in case q = pr1p12, e ⩾ 3. Discret. Math. 17(2): 199-205 (1977)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
