On LCP and checkable group codes over finite non-commutative Frobenius rings
arXiv:2303.18194
Abstract
We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact for checkeable codes over the same type of alphabet.