论文标题
能力实现代码：双重传递性的审查
Capacity-achieving codes: a review on double transitivity
论文作者
论文摘要
最近证明，如果线性代码在双重传递置换组的作用下是不变的，则可以实现擦除通道的能力。因此，在此类排列组下对所有代码进行分类是足够的兴趣。我们朝这个方向迈出了一步，并对所有合适的组进行了审查，并对这些组下的代码不变。事实证明，代数几何代码有能力方面的家族。
Recently it was proved that if a linear code is invariant under the action of a doubly transitive permutation group, it achieves the capacity of erasure channel. Therefore, it is of sufficient interest to classify all codes, invariant under such permutation groups. We take a step in this direction and give a review of all suitable groups and the known results on codes invariant under these groups. It turns out that there are capacity-achieving families of algebraic geometric codes.
