← All problems

The BLTA characterization conjecture for decreasing monomial codes

5 years old · traced to

Let MM be a decreasing monomial code, let A-Aut(M)A\text{-}Aut(M) denote its affine automorphism group, and let BLTA(s,n)BLTA(s,n) be the corresponding BLTA group.

BLTA characterization conjecture.

BLTA(s,n)=A-Aut(M)BLTA(s,n) = A\text{-}Aut(M)

This conjecture concerns the affine automorphisms of decreasing monomial codes, with decreasing polar codes and Reed–Muller codes as special cases. The unrestricted equality BLTA(s,n)=Aut(M)BLTA(s,n)=Aut(M) is false in general, since numerical experiments found automorphisms outside BLTA; the affine version is proved in the paper.

References

Status

  • Solved: Yuan Li, Huazi Zhang, Rong Li, Jun Wang, Wen Tong, Guiying Yan, and Zhiming Ma. The Complete Affine Automorphism Group of Polar Codes (arXiv preprint, 2021) https://arxiv.org/abs/2103.14215

Source: Yuan Li, Huazi Zhang, Rong Li, Jun Wang, Wen Tong, Guiying Yan and Zhiming Ma, “The Complete Affine Automorphism Group of Polar Codes”, arXiv:2103.14215 (2021).

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.