Abstract
In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We first point out the relationship between Delsarte complementary dual codes (Delsarte LCD codes) and Gabidulin complementary dual codes (Gabidulin LCD codes). We then construct two classes of Gabidulin LCD MRD codes by self-dual basis (or almost self-dual basis) of the finite field \(\mathbb {F}_{q^{m}}\) over base field \(\mathbb {F}_{q}\). Finally, we give an interesting application of rank-metric LCD codes in decoding algorithm.
Similar content being viewed by others
References
Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106/107, 337–342 (1992)
Bringer, J., Carlet, C., Chabanne, H., Guilley, S., Maghrebi, H.: Orthogonal direct sum masking, a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: Proceedings of WISTP 2014. Lecture Notes in Computer Science, vol. 8501, pp. 40–56 (2014)
Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. In: Post-Proceedings of the 4th International Castle Meeting, Palmela Castle, Portugal, September 15–18, 2014, Published by the Journal Advances in Mathematics of Communications (AMC), vol. 10(1), pp. 131–150 (2016)
Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. In: Proceedings of the 4th ICMCTA Meeting. Palmela, Portugal (2014)
Guenda, K., Jitman, S., Gulliver, T.A.: Constructions of good entanglement-assisted quantum error correcting codes. Des. Codes Cryptogr. (2017). https://doi.org/10.1007/s10623-017-0330-z
Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discrete Math. 126, 391–393 (1994)
Sendrier, N.: Linear codes with complementary duals meet the Gilbert–Varshamov bound. Discrete Math. 304, 345–347 (2004)
Esmaeili, M., Yari, S.: On complementary-daul quasi-cyclic codes. Finite Field Appl. 15, 357–386 (2009)
Dougherty, S.T., Kim, J.L., Ozkaya, B., Sok, L., Solé, P.: The combinatorics of LCD codes: linear programming bound and orthogonal matrices. Int. J. Inf. Coding Theory 4, 116–128 (2017)
Li, C., Ding, C., Li, S.: LCD cyclic codes over finite fields. IEEE Trans. Inf. Theory 63(7), 4344–4356 (2017)
Li, C., Ding, C., Liu, H.: Parameters of two clesses of LCD BCH codes, (2016). arXiv:1608.02670
Li, C., Ding, C., Liu, H.: A family of reversible BCH codes, (2016). arXiv:1608.02169
Boonniyoma, K., Jitman, S.: Complementary daul subfield linear codes over finite fields, (2016). arXiv:1605.06827
Jin, L.: Construction of MDS codes with complementary duals. IEEE Trans. Inf. Theory (2016). https://doi.org/10.1109/TIT.2016.2645759
Carlet, C., Mesnager, S., Tang, C., Qi, Y.: Euclidean and Hermitian LCD MDS codes. Des. Codes Cryptogr. (2018). https://doi.org/10.1007/s10623-018-0463-8
Chen, B., Liu, H.: New constructions of MDS codes with complementary duals, (2017). arXiv:1702.07831v1
Sari, M., Köroǧlu: On MDS negacyclic LCD codes, (2016). arXiv:1611.06371
Zhu, S., Pang, B., Sun, Z.: The reversible negacyclic codes over finite fields, (2016). arXiv:1610.08206
de la Cruz, J., Willems, W.: A note on group codes with complementary duals. Des. Codes Cryptogr. (2017). https://doi.org/10.1007/s10623-017-0437-2
Mesnager, S., Tang, C., Qi, Y.: Complementary dual algebraic geometry codes. IEEE Trans. Inf. Theory 64(4), 2390–2397 (2018)
Liu, X., Fan, Y., Liu, H.: Galois LCD codes over finite fields. Finite Field Appl. 49, 227–242 (2018)
Liu, X., Liu, H.: LCD codes over finite chain rings. Finite Field Appl. 15, 1–19 (2015)
Delsarte, P.: Bilinear forms over a finite field, with applications to coding theorey. J. Combin. Theory Ser. A 25, 226–241 (1978)
Kötter, R., Kschischang, F.R.: Coding for erroes and erasures in randon network coding. IEEE Trans. Inf. Theory 54, 3579–3591 (2008)
Silva, D., Kschischang, F.R.: On metris for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479–5490 (2009)
Silva, D., Kschischang, F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory 57(2), 1124–1135 (2011)
Gabidulin, E.: Theory of codes with maximum rank distance. Probl. Inf. Trans. 1(2), 1–12 (1985)
Durai Raja, R.S.: On linear codes with rank metric: constructions, properties, and applications. Ph.D. Dessertation, Department of Mathematics, Indian Institute of Technology-Chennai, India (May 2004)
Devi, M.: On the class of T-direct codes: constructions, properties and applications. Ph.D. Dessertation, Department of Mathematics, Jaypee University of Information Technology, India, (August 2013)
Gabidulin, E., Pilipchuk, N.I.: Symmetric matrices and codes correcting rank error beyond the \(\lfloor \frac{d-1}{2}\rfloor \) bound. Discrete Appl. Math. 154, 305–312 (2006)
Raja Durai, R.S., Devi, M.: On the class of \(\cal{T}\)-direct codes over \(GF(2^N)\). Int. J. Comput. Inf. Syst. Ind. Manag. Appl. 5, 589–596 (2013)
Kshevelskiy, A., Gabidulin, E.: The new construction of rank code. Probl. Inf. Trans. 1(2), 2105–2108 (2005)
Ravagnani, A.: Rank-metric codes and their duality theory. Des. Codes Cryptogr. 80, 179–216 (2016)
MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting Codes, North Holland Mathematical Library. Elsevier, Amsterdam (1977)
Jungnickel, D., Menezes, A.J., Vanstone, S.A.: On the number of self-dual bases of \(GF(q^m)\) over \(GF(q)\). Proc. Am. Math. Soc. 109, 23–29 (1990)
Raja Durai, R.S.: On Linear Codes with Rank Metric: Constructions, Properties, and Applications. Ph.D. Dessertation, Department of Mathematics, Indian Institute of Technology-Chennai, India (May 2004)
Gadouleau, M., Yan, Z.: Properies of codes with the rank metric. In: IEEE Global Telecommunications Conference, New York. GLOBECOM 06, pp. 1–5 (2006)
Acknowledgements
The authors would like to sincerely thank the editor and the referees for very meticulous readings of this paper, and for valuable suggestions which help us to create an improved version. The authors also thank Dr. Jian Bai for many helpful discussion. This research was supported by Research Funds of Hubei Province (Grant Nos. D20144401 and Q20174503), and Research Project of Hubei Polytechnic University (Grant No. 17xjz03A).
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
Liu, X., Liu, H. Rank-metric complementary dual codes. J. Appl. Math. Comput. 61, 281–295 (2019). https://doi.org/10.1007/s12190-019-01254-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12190-019-01254-1