Institution
Turku Centre for Computer Science
Facility•Turku, Finland•
About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the authors studied the problem of constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which (r + 1) l n.
Abstract: Constructions of optimal locally repairable codes (LRCs) in the case of (r + 1) l n and over small finite fields were stated as open problems for LRCs in [I. Tamo et al., “Optimal locally repairable codes and connections to matroid theory”, 2013 IEEE ISIT]. In this paper, these problems are studied by constructing almost optimal linear LRCs, which are proven to be optimal for certain parameters, including cases for which (r + 1) l n. More precisely, linear codes for given length, dimension, and all-symbol locality are constructed with almost optimal minimum distance. ‘Almost optimal’ refers to the fact that their minimum distance differs by at most one from the optimal value given by a known bound for LRCs. In addition to these linear LRCs, optimal LRCs which do not require a large field are constructed for certain classes of parameters.
11 citations
01 Nov 2006
TL;DR: A fault-tolerant on-chip routing philosophy for two-dimensional meshes is introduced and an automatic rerouting property to a single switch node is designed and added return channel to the communication route.
Abstract: We introduce fault-tolerant on-chip routing philosophy for two-dimensional meshes. It is an extension to the concept of packet connected circuit, PCC. In order to increase reliability we have designed an automatic rerouting property to a single switch node and added return channel to the communication route. An autonomic routing switch node is modeled asynchronously and implemented using Haste language. The logical functionality of routing is illustrated as a single study case in 7*8 mesh. The routing success is further analyzed in congesting and faulty environment.
11 citations
TL;DR: A new, dynamical way to study powers (that is, repetitions) in Sturmian words based on results from Diophantine approximation theory is presented and a previously known formula for the fractional index of a Sturmians word is obtained.
11 citations
TL;DR: Three algebraic constructions of authentication codes with secrecy have simple algebraic structures and are easy to implement and are asymptotically optimal with respect to certain bounds.
Abstract: In this paper, we present three algebraic constructions of authentication codes with secrecy. The codes have simple algebraic structures and are easy to implement. They are asymptotically optimal with respect to certain bounds.
11 citations
TL;DR: It is shown that Baker's inapproximability results of transcendental numbers can be solved in polynomial time with respect to the length of n, and that this approach works also for much more general expressions of algebraic numbers.
11 citations
Authors
Showing all 383 results
| Name | H-index | Papers | Citations |
|---|---|---|---|
| José A. Teixeira | 101 | 1414 | 47329 |
| Cunsheng Ding | 61 | 254 | 11116 |
| Jun'ichi Tsujii | 59 | 389 | 15985 |
| Arto Salomaa | 56 | 374 | 17706 |
| Tero Aittokallio | 52 | 271 | 8689 |
| Risto Lahdelma | 48 | 149 | 6637 |
| Hannu Tenhunen | 45 | 819 | 11661 |
| Mats Gyllenberg | 44 | 204 | 8029 |
| Sampo Pyysalo | 42 | 153 | 8839 |
| Olli Polo | 42 | 140 | 5303 |
| Pasi Liljeberg | 40 | 306 | 6959 |
| Tapio Salakoski | 38 | 231 | 7271 |
| Filip Ginter | 37 | 156 | 7294 |
| Robert Fullér | 37 | 152 | 5848 |
| Juha Plosila | 35 | 342 | 4917 |