Abstract
The problem of delay-insensitive data communication is described. The notion of delay-insensitive code is defined, giving precise conditions under which delay-insensitive data communication is feasible. Examples of these codes are presented and analyzed. It appears that delay-insensitive codes are equivalent with antichains in partially ordered sets and with all unidirectional error-detecting codes.
| Original language | English |
|---|---|
| Pages (from-to) | 1-8 |
| Journal | Distributed Computing |
| Volume | 3 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1988 |