Abstract
Codes correcting pair-errors (substitutions) for symbol-pair read channels were introduced recently by Cassuto and Blaum(2011). In this work, we study codes correcting synchronization errors, including deletions and sticky-insertions, for symbol-pair read channels owing to their application in racetrack memory. We first investigate deletion-correcting-code in symbol-pair read channels and then construct several codes that are larger than known codes in classical deletion-channels. Finally, we examine codes correcting a combination of deletions and substitutions.