New Channel Coding Lower Bounds for Noisy Permutation Channels

Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use $\epsilon$-packing with Kullback-Leibler divergence as a metric to bound the distance between distributions and are tighter than existing bounds. Additionally, Gaussian approximations of achievability bounds are derived, and the numerical evaluation shows the precision of the approximation.