Abstract
Blackford (Finite Fields Appl. 24, 29–44 2013) introduced Type I constacyclic duadic codes over the finite field \(\mathbb {F}_{q}\), where q is an odd prime power, and obtained isodual codes from them. In this paper, we generalize this idea and present Type II q-splitting of some special natural numbers n over \(\mathbb {F}_{q}\). By using it, we construct isodual codes of length n + r over \(\mathbb {F}_{q}\) for some r, where r is some divisor of n and q − 1, and provide some examples of optimal isodual codes.
Similar content being viewed by others
References
Alahmadi, A., Alsulami, S., Hijazi, R., Solé, P.: Isodual cyclic codes over finite fields of odd characteristic. Discrete Math. 339, 344–353 (2016)
collab=Blackford. T: Negacyclic duadic codes. Finite Fields Appl. 14, 930–943 (2008)
Blackford, T.: Isodual constacyclic codes. Finite Fields Appl. 24, 29–44 (2013)
Grassl, M. http://codetables.de, accessed on 04.11.2012
Huffman. W.C, Pless, V.: Fundamentals of error correcting codes. Cambrigde University Press, Cambrigde (2003)
Karbaski, A.S., Samei, K., Sepahvand, T.: Constacyclic duadic codes over \(\mathbb {F}_{4}\). Appl. Algebra Eng. Commun. Comput. (To appear)
Kim, H., Lee, Y.: Construction of isodual codes over GF(q). Finite Fields Appl. 45, 372–385 (2017)
Yang, Y., Cai, W.: On self-dual constacyclic codes over finite fields. Des. Codes Cryptoger. 74, 355–364 (2015)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Izadi, M., Karbaski, A.S., Rezaei, R. et al. Isodual codes over \(\mathbb {F}_{q}\) from a multiplier. Cryptogr. Commun. 14, 973–982 (2022). https://doi.org/10.1007/s12095-022-00561-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-022-00561-y