The following pages link to Aimo Tietäväinen (Q1199638):
Displaying 17 items.
- (Q811479) (redirect page) (← links)
- Covering radius and dual distance (Q811480) (← links)
- On the covering radius of long binary BCH codes (Q1093616) (← links)
- On binary cyclic codes with minimum distance \(d=3\). (Q1130096) (← links)
- On the cardinality of sets of sequences with given maximum correlation (Q1199639) (← links)
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419) (← links)
- Character sum constructions of constrained error-correcting codes (Q1311610) (← links)
- A simple method to estimate the maximum nontrivial correlation of some sets of sequences (Q1320445) (← links)
- Long binary narrow-sense BCH codes are normal (Q1352424) (← links)
- Upper bounds on the covering radius of a code with a given dual distance (Q1911845) (← links)
- On the minimum distances of non-binary cyclic codes (Q1963168) (← links)
- On a problem of Chowla and Shimura (Q2544807) (← links)
- An upper bound on the covering radius as a function of the dual distance (Q3199332) (← links)
- (Q3312149) (← links)
- (Q3318856) (← links)
- (Q3318857) (← links)
- A note on Waring's problem in GF (p) (Q4777390) (← links)
