Abstract
A new constrained edit distance between an ordered set of input strings and a single output string is proposed, where all the strings are over a finite alphabet. Editing transformation includes deletion of symbols from the input strings, combination of the decimated input strings by a function with memory, and substitution and insertion of symbols in the combination string. Constraints are related to the total number of edit operations and to the maximum numbers of consecutive deletions and insertions. A recursive algorithm for efficient computation of the constrained edit distance is derived and its computational complexity is determined. Potential applications in cryptanalysis of shift-register-based stream ciphers and in decoding for parallel communication channels with synchronization errors are also discussed.
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.
