Abstract
Given positive integers and , let denote the maximum size of a permutation code of length and minimum Hamming distance . The Gilbert-Varshamov bound asserts that where is the volume of a Hamming sphere of radius in . Recently, Gao, Yang, and Ge showed that this bound can be improved by a factor , when is fixed and . Herein, we consider the situation where the ratio is fixed and improve the Gilbert-Varshamov bound by a factor that is \emph{linear in }. That is, we show that if , then where is a positive constant that depends only on . To establish this result, we follow the method of Jiang and Vardy. Namely, we recast the problem of bounding into a graph-theoretic framework and prove that the resulting graph is locally sparse.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.