DeepAI AI Chat
Log In Sign Up

Capacity-achieving codes: a review on double transitivity

by   Kirill Ivanov, et al.

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.


page 1

page 2

page 3

page 4


Decoding twisted permutation codes

We consider twisted permutation codes, a class of frequency permutation ...

Involutory permutation automorphisms of binary linear codes

We investigate the properties of binary linear codes of even length whos...

On the algebraic structure of quasi group codes

In this note, an intrinsic description of some families of linear codes ...

Infinite families of 3-designs from APN functions

Combinatorial t-designs have nice applications in coding theory, finite ...

New advances in permutation decoding of first-order Reed-Muller codes

In this paper we describe a variation of the classical permutation decod...

Investigations on Automorphism Groups of Quantum Stabilizer Codes

The stabilizer formalism for quantum error-correcting codes has been, wi...