Abstract
This paper presents a comparative study on the distance optimality for Distance-Preserving Mappings codes generated from different constructions. Few constructions are considered to investigate the reasons behind making codes optimum when they reach the upper bound on the sum of the Hamming distances for certain lengths of the permutation sequences. The technique of cyclic-shift prefix or suffix of permutation symbols is used to investigate the conditions making distance-preserving mappings codes optimum.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
