2009
DOI: 10.1007/978-3-642-01970-8_60
| View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels. In the literature it is possible to find optimal sequential algorithms for codes belonging to this class, but, for the best of our knowledge, no parallel algorithm is reported. In this paper we present the first encoding and decoding parallel algorithms for Dandelion-like codes. Namely, we design a unique encoding algorithm and a unique decoding algorithm that, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…The tree corresponding to the Dandelion code C = (6, 2, 1, 7, 3, 7, 3, 8) is the tree given in Figure 1, where edge orientation has been provided for clarity. Linear-time encoding and decoding algorithms are common in literature for all Dandelion-like codes and [24] provided unique parallel encoding and decoding algorithms that when properly parametrized, can be utilized for all Dandelion-like mappings. All in all, both theoretical and experimental results have proven [23] that the Dandelion code positively satisfies all five properties enunciated by Palmer and Kershembaum, hence concluding that it is a suitable tree encoding choice for an efficient tree representation.…”
Section: A Dandelion Decodingmentioning
confidence: 99%
“…The tree corresponding to the Dandelion code C = (6, 2, 1, 7, 3, 7, 3, 8) is the tree given in Figure 1, where edge orientation has been provided for clarity. Linear-time encoding and decoding algorithms are common in literature for all Dandelion-like codes and [24] provided unique parallel encoding and decoding algorithms that when properly parametrized, can be utilized for all Dandelion-like mappings. All in all, both theoretical and experimental results have proven [23] that the Dandelion code positively satisfies all five properties enunciated by Palmer and Kershembaum, hence concluding that it is a suitable tree encoding choice for an efficient tree representation.…”
Section: A Dandelion Decodingmentioning
confidence: 99%
“…, C n−1 }. Both lineartime encoding and decoding algorithms have been widely utilized in the literature for all Dandelion-like codes [11]. The decoding procedure produces an output tree T ∈ n , with n denoting the set of possible trees interconnecting n nodes.…”
Section: Dandelion Codes For Tree Encodingmentioning
confidence: 99%
“…After each step we set g [v] = g[g [v]] and we stop after log n steps to avoid infinite recursion inside cycles. The procedure details are as follows: for v = 0 to n − 1 in parallel do 6. η(v) = max(η(v), g [v], η(g [v])) 7.…”
Section: Decoding Algorithmmentioning
confidence: 99%
“…Concerning parallel algorithms, studies have been performed and algorithms are known both for Prüfer-like codes [5] and for Dandelion-like codes [7]. The interested reader may found a complete survey on all these codes in [3].…”
Section: Introductionmentioning
confidence: 99%