Answers are grounded in this paper and cite their sources.
An additive code is an I\!Fq-linear subspace of I\!Fqᵐⁿ over I\!Fqᵐ, which is not a linear subspace over I\!Fqᵐ. Linear complementary pairs (LCP) of codes have important roles in cryptography, such as increasing the speed and capacity of digital communication and strengthening security by improving the encryption necessities to resist cryptanalytic attacks. This paper studies an algebraic structure of additive complementary pairs (ACP) of codes over I\!Fqᵐ. Further, we characterize an ACP of codes in analogous generator matrices and parity check matrices. Additionally, we identify a necessary condition for an ACP of codes. Besides, we present some constructions of an ACP of codes over I\!Fqᵐ from LCP codes over I\!Fqᵐ and also from an LCP of codes over I\!Fq. Finally, we study the constacyclic ACP of codes over I\!Fqᵐ and the counting of the constacyclic ACP of codes. Finally, we exhibit an interesting application of ACP of codes in coding for the two-user binary adder channel.
No takes yet. Share an insight, caveat, or question.
Bhowmick et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: