Abstract | ||
---|---|---|
We survey results and problems concerning structural properties of the hierarchy of classes of codes. In particular, we show that abstract dependence systems can be used to gain new insights into hierarchy constructions and decidability proofs. From the same perspective, we also review some work on maximal codes. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1007/3-540-57163-9_4 | FCT |
Field | DocType | ISBN |
Discrete mathematics,Computer science,Theoretical computer science,Decidability,Mathematical proof,Regular language,Hierarchy,Prefix code,Distributed computing | Conference | 3-540-57163-9 |
Citations | PageRank | References |
5 | 0.71 | 17 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Helmut Jürgensen | 1 | 208 | 43.68 |
Stavros Konstantinidis | 2 | 283 | 31.10 |