We study the problem of delay-insensitivity from a coding point of view. We define sequencing rules, i.e., the rules dictating which symbols can follow which. For example, spacer-based encoding schemes obey a sequencing rule that requires a spacer to be inserted after each symbol conveying information. We define mathematically delay-insensitive sequencing rules and study the ones which maximize bandwidth efficiency.