Abstract
We study the size (or volume) of balls in the metric space of permutations, S n , under the infinity metric. We focus on the regime of balls with radius r = ρ · (n−1), ρ ∈ [0, 1], i.e., a radius that is a constant fraction of the maximum possible distance. We provide new bounds on the size of such balls. These bounds reduce the asymptotic gap between the upper and lower bound to at most 0.06 bits per symbol.
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.
