One Method of Constructing Quasilinear Codes Providing Synchronization in the Presence of Errors

A method is proposed for the construction of a family of codes of length $n$, these being the cosets of linear codes, providing synchronization in the presence of no more than t errors in $n$ successive symbols. Upper and lower bounds are obtained for the minimal redundancy of the codes of this family. From the bounds obtained follows the asymptotic expression for minimal redundancy under the condition that $t/n\to 0$.