论文标题
用于编码和随机排列问题的递归方法
Recursive methods for some problems in coding and random permutations
论文作者
论文摘要
在本文中，我们研究了递归对编码和随机排列问题的三种应用。首先，我们考虑具有部分位置的本地可回收代码，并使用递归来估计此类代码的最小距离。接下来，我们考虑加权晶格代表代码，并使用递归亚辅助技术来获得最小代码尺寸的收敛性。最后，我们获得了一个递归关系，涉及随机排列中的循环矩，作为例证，评估了均值和方差的递归。
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next we consider weighted lattice representative codes and use recursive subadditive techniques to obtain convergence of the minimum code size. Finally, we obtain a recursive relation involving cycle moments in random permutations and as an illustration, evaluate recursions for the mean and variance.
