We provide a new definition for the concept of skew in parallel asynchronou
s communications introduced in [2]. The new definition extends and strength
ens previously known results on skew. We give necessary and sufficient cond
itions for codes that can tolerate a certain amount of skew under the new d
efinition. We also extend the results to codes that can tolerate a certain
amount of skew-and detect a larger amount of skew when the tolerating thres
hold is exceeded.