Name
Abstract | ||
|---|---|---|
We study how the concept of bounded synchronization delay is related to retrograde comma-free codes. Retrograde codes are a subclass of comma-free codes in which the dictionary of code words excludes not only overlaps of code words but also reversals of overlaps. We give a general upper bound on the maximum size of a retrograde comma-free distionary, provide a construction for a bounded synchronization delay retrograde code which attains this maximum size, and discuss traditional dictionaries in the context of retrograde codes. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0890-5401(92)90054-J | Inf. Comput. |
Keywords | Field | DocType |
bounded synchronization delay,retrograde code | Discrete mathematics,Online codes,Combinatorics,Luby transform code,Computer science,Golomb coding,Turbo code,Block code,Expander code,Raptor code,Linear code | Journal |
Volume | Issue | ISSN |
96 | 1 | Information and Computation |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hollie L. Buchanan | 1 | 0 | 0.34 |
| Michael E. Mays | 2 | 5 | 1.12 |