Coding for skew correcting and detecting in parallel asynchronous communications

We study the problem of pipelined transmission in parallel asynchronous communications allowing a certain amount of skew. We redefine the concept of skew in a way that extends previously known results in this area. Using the new definition of skew, we derive the necessary and sufficient conditions for codes that can tolerate a certain amount of skew and detect a larger amount of skew when the tolerating threshold is exceeded.