Abstract
Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.
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.
