Abstract

Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.

Full Text
Paper version not known

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 call

Disclaimer: 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.