Abstract
Given a finite alphabet A and a quasi-metric d over A⁎, we introduce the relation τd,k⊆A⁎×A⁎ such that (x,y)∈τd,k holds whenever d(x,y)≤k. The error detection capability of variable-length codes is expressed in term of conditions over τd,k. With respect to the prefix metric, the factor one, and any quasi-metric associated with some free monoid (anti-)automorphism, we prove that one can decide whether a given regular variable-length code satisfies any of those error detection constraints.
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.
