Abstract
A class of binary block codes capable of simultaneous correction of additive errors and synchronization errors is presented. This class of codes consists of coset codes of binary cyclic or shortened cyclic codes, and retains the implementation advantages of binary cyclic codes. In most cases, the redundancy required to provide additive-error correction is sufficient to give synchronization-error correction so that no additional redundant bits are required. Synthesis procedures to construct such codes are also presented, along with an upper bound on the number of synchronization errors which can be corrected by codes in this class.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
