Motivated by the application of point-to-point communication networks and biological storage, we investigate new channel coding bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new achievability 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.

翻译：受点对点通信网络和生物存储应用的启发，我们研究了具有严格正定满秩方阵的噪声置换信道的新信道编码界。我们新的可达性界采用以Kullback-Leibler散度为度量的$\epsilon$-填充来约束分布间的距离，该界比现有界更紧。此外，本文推导了可达性界的高斯近似，数值评估验证了该近似的精确性。