Capacity-achieving codes: a review on double transitivity

Autor:	Ivanov, Kirill, Urbanke, Rüdiger L.
Rok vydání:	2020
Předmět:	Computer Science - Information Theory
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2010.15453 Zobrazit plný text záznamu View this record from Arxiv