MDS constacyclic codes of length q + 1 over GF(q)

Blackford, T.: Negacyclic duadic codes. Finite Fields Appl. 14, 930–943 (2008)

Casse, L. R. A., Glynn, D. G.: The solution to Beniamino Segre’s problem ir,q, r = 3, q = 2h. Geom. Ded. 13, 157–163 (1982)

Chen, B., Dinh, H. Q., Fan, Y., Ling, S.: Polyadic constacyclic codes. IEEE Trans. Inf. Theory 61(9), 4895–4904 (2015)

Chen, B., Fan, Y., Lin, L., Liu, H.: Constacyclic codes over finite fields. Finite Fields Appl. 18, 1217–1231 (2012)

Dahl, C., Pedersen, J. P.: Cyclic and pseudo-cyclic MDS codes of length q + 1. J. Comb. Theory Ser. A 59, 130–133 (1992)

Danev, D., Dodunekov, S., Radkova, D.: A family of constacyclic ternary quasi-perfect codes with covering radius 3. Des. Codes Cryptogr. 59, 111–118 (2011)

Da Rocha, V.: Maximum distance separable multilevel codes. IEEE Trans. Inf. Theory 30(3), 547–548 (1984)

Ding, C., Helleseth, T., Klø ve, T., Wang X.: A general construction of authentication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007)

Ding, C., Laihonen, T., Renvall, A.: Linear multi-secret sharing schemes and error-correcting codes. J. Universal Computer Science 3(9), 1023–1036 (1997)

Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem: Applications in Computing, Coding and Cryptography. World Scientific, Singapore (1996)

Dinh, H. Q.: Constacyclic codes of length ps over $\mathbb {F}_{p^{m}}+u \mathbb {F}_{p^{m}}$. J. Algebra 324, 940–950 (2010)

Georgiades, J.: Cyclic (q + 1,k)-codes of odd order q and even dimension k are not optimal. Atti. Sent. Mat. Fis. Univ. Modena 30, 284–285 (1982)

Gupta, K. C., Pandey, S. K., Ray, I. G., Samanta, S.: Cryptographically significant MDS matrices over finite feilds: a brief survey and some generalized results. Adv. Math. Commun. 13(4), 779–843 (2019)

Krishna, A., Sarwate, D. V.: Pseudocyclic maximum-distance-separable codes. IEEE Trans. Inf. Theory 36(4), 880–884 (1990)

Koroglu, M. E., San, M.: On MDS negacyclic LCD codes. Filomat 33(1), 1–12 (2019)

La Guardia, G. G.: On optimal constacyclic codes. Linear Algebra Appl. 496, 594–610 (2016)

Li, S., Xiong, M., Ge, G.: Pseudocyclic codes and the construction of quantum MDS codes. IEEE Trans. Inf. Theory 62(4), 1703–1710 (2016)

Liu, Y., Li, R., Lv, L., Ma, Y.: A class of constacyclic BCH codes and new quantum codes. Quantum Inf. Process. 16(66), 1–16 (2017)

MacWilliams, F. J., Sloane, N. J. A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

Maruta, T.: On the uniqueness of cyclic MDS codes, Atti Sem. Mat. Fis. Univ. Modena XL 83–88 (1992)

Maruta, T.: On the existence of cyclic and pseudo-cyclic MDS codes. Europ. J. Combinatorics 19, 159–174 (1998)

Mi, J., Cao, X.: Constructing MDS Galois self-dual constacyclic codes over finite fields. Discrete Math. 344(6), 1–15 (2021)

Pedersen, J. P., Dahl, C.: Classification of pseudo-cyclic MDS codes. IEEE Trans. Inf. Theory 37(2), 365–370 (1991)

Peterson, W. W., Weldon, E. J.: Error-Correcting Codes, 2nd edn. MIT Press, Cambridge (1972)

Renvall, A., Ding, C.: The access structure of some secret sharing schemes. Information Security and Privacy, LNCS 1172, pp 67–78. Springer, Berlin (1996)

Renvall, A., Ding, C.: A nonlinear secret sharing scheme. Information Security and Privacy. LNCS 1172, pp 56–65. Springer, Berlin (1996)

Sun, Z., Zhu, S., Wang, L.: A class of constacyclic BCH codes. Cryptogr. Commun. 12, 265–284 (2020)

Tang, C., Wang, Q., Ding, C.: The subfield subcodes and subfield codes of a family of MDS codes. IEEE Trans. Inf. Theory 68(9), 5792–5801 (2022)