🤖 AI Summary
This work addresses the construction of Linear Complementary Pairs (LCPs) of quasi-cyclic (QC) and quasi-twisted (QT) codes of index 2. We establish, for the first time, a complete algebraic characterization framework for such LCPs over polynomial rings. By rigorously analyzing the module structure and duality properties of QC/QT codes, we derive necessary and sufficient conditions for LCPs in terms of polynomial generators. Leveraging these conditions, we systematically construct multiple families of LCPs achieving (near-)optimal security parameters—including maximal minimum distance and dimension—relative to known bounds. The resulting code pairs attain or approach theoretical limits, significantly outperforming prior constructions. These advances enable direct application in post-quantum cryptographic protocols—particularly LCP-based public-key encryption and digital signatures—as well as secure coding schemes.
📝 Abstract
In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes with (almost) optimal security parameters.