xl1m1l2m2l3m3−a and a-constacyclic codes over a finite field
References
- Chen, B., Li, L., Tuerhong, R. (2013). Explicit factorization of x2mpn−1 over a finite field. Finite Field Appl. 24:95–104. DOI: 10.1016/j.ffa.2013.06.002.
- Huffman, W. C., Pless, V. (2003). Fundamentals of Error-Correcting Codes. Cambridge: Cambridge University Press.
- Li, F., Cao, X. (2017). A class of minimal cyclic codes over finite fields. Discrete Math. 340(1):3197–3206. DOI: 10.1016/j.disc.2016.07.005.
- Li, F., Yue, Q. (2018). The primitive idempotents and weight distributions of irreducible constcyclic codes. Des. Codes Cryptogr. 86(4):771–784. DOI: 10.1007/s10623-017-0356-2.
- Lidl, R., Niederreiter, H. (2008). Finite Fields. Cambridge: Cambridge University Press.
- MacWilliams, F. J., Sloane, N. (1977). The Theory of Error-Correcting Codes. New York: Elsevier/North-Holland.
- Shi, Z., Fu, F. (2020). The primitive idempotents of irreducible constcyclic codes and LCD cyclic codes. Cryptogr. Commun. 12(1):29–52. DOI: 10.1007/s12095-019-00362-w.
- Wu, Y., Yue, Q., Fan, S. (2018). Further factorization of xn−1 over a finite field. Finite Field Appl. 54:197–215. DOI: 10.1016/j.ffa.2018.07.007.