A reliable storage system requires a strategy to recover from erasure of a
data sector's frame synchronization character, This article describes a nov
el recursive algorithm for calculating the optimal sequence of locations at
which synchronization is forced in the case of such an erasure. The algori
thm is based on measurable statistics. Results for mean time to recovery ar
e presented.