Trace duality and additive complementary pairs of additive cyclic codes over finite chain rings
By: Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue and more
Potential Business Impact:
Makes computer codes stronger for better data protection.
This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are free modules. Moreover, we present a necessary and sufficient condition for a pair of additive cyclic codes over a finite commutative ring to form an additive complementary pair. Finally, we construct a complementary pair of additive cyclic codes over a finite chain ring and show that one of the codes is permutation equivalent to the trace dual of the other.
Similar Papers
Duality on group algebras over finite chain rings: applications to additive group codes
Information Theory
Makes computer codes more efficient for sending data.
On polycyclic linear and additive codes associated to a trinomial over a finite chain ring
Information Theory
Simplifies complex math for better computer codes.
Linear Complementary Pairs of Quasi-Cyclic and Quasi-Twisted Codes
Information Theory
Makes secret codes stronger and harder to break.