Searching for authors named "Tero Laihonen" – sorted by Relevance.
-
On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
- Bounds for Minimum Distance and Covering Radius of Non-binary Codes TERO LAIHONEN terolai
- Cited by 3 (1 self) – Add To MetaCart
-
and
- Uppsala University P.O. Box 480 SE-751 06 Uppsala, Sweden and Tero Laihonen ∗ Department of Mathematics
- Add To MetaCart
-
A.: "Linear Multisecret-Sharing Schemes and Error-Correcting Codes
- @(email omitted);) Tero Laihonen (Department of Mathematics, University ofTurku FIN-20014 Turku, Finland terolai
- Cited by 1 (0 self) – Add To MetaCart
-
On identifying codes in binary Hamming spaces
- by the Academy of Finland under grant #44002. Tero Laihonen Department of Mathematics University of Turku FIN
- Cited by 4 (0 self) – Add To MetaCart
-
identifying
- † Tero Laihonen ‡ Sanna Ranto § 8 January 2008 Abstract Let G = (V, E) be an undirected graph without
- Add To MetaCart
-
On Strongly Identifying Codes
- On Strongly Identifying Codes Iiro Honkala Tero Laihonen Sanna Ranto Turku Centre for Computer
- Cited by 2 (1 self) – Add To MetaCart
-
Families of Optimal Codes for Strong Identification
- Families of Optimal Codes for Strong Identication Tero Laihonen Sanna Ranto Turku Centre
- Add To MetaCart
-
On Relations Between Covering Radius and Dual Distance
- , Member, IEEE, Tero K. Laihonen z and Simon N. Litsyn x , Member, IEEE Abstract The covering radius
- Cited by 3 (2 self) – Add To MetaCart

