Nonexistence of binary quasi group codes with involutory permutation automorphism group

Let CC be a binary quasi group code of length n=2m>2n=2m>2, and let PAut(C)\operatorname{PAut}(C) denote its permutation automorphism group. Nonexistence conjecture. There is no binary quasi group code CC of length n=2m>2n=2m>2 such that

PAut(C)C2.\operatorname{PAut}(C)\cong C_2.

This conjecture generalizes the preceding nonexistence result for lengths 2<n=2m82<n=2m\leq 8; the authors report that computer calculations suggest it, but a proof would require handling many cases.

Sources & referencesView supporting material

Primary source

Fatma Altunbulak Aksu, Roghayeh Hafezieh and İpek Tuvay, “Involutory permutation automorphisms of binary linear codes”, arXiv:2208.00299 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.