Abstract
We give better lower bounds for M(n, d), for various positive integers d and n with d < n, where M(n, d) is the largest number of permutations on n symbols with pairwise Hamming distance at least d. Larger sets of permutations on n symbols with pairwise Hamming distance d is a necessary component of constructing error correcting permutation codes, which have been proposed for power-line communications. Our technique, Parallel Partition and Extension, is universally applicable to constructing such sets for all n and all d, d < n.
Sign-in/Register to access full text options 
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.
