Linear Complementary Pairs of Quasi-Cyclic and Quasi-Twisted Codes

📅 2025-04-21
📈 Citations: 0
Influential: 0
📄 PDF
🤖 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.

Technology Category

Application Category

📝 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.
Problem

Research questions and friction points this paper is trying to address.

Characterize linear complementary pairs of quasi-cyclic codes
Characterize linear complementary pairs of quasi-twisted codes
Provide examples with optimal security parameters
Innovation

Methods, ideas, or system contributions that make the work stand out.

Polynomial characterization of linear complementary pairs
Quasi-cyclic and quasi-twisted codes of index 2
Examples with optimal security parameters
🔎 Similar Papers
K
Kanat Abdukhalikov
Department of Mathematical Sciences, UAE University, PO Box 15551, Al Ain, UAE
Duy Ho
Duy Ho
UiT The Arctic University of Norway
S
San Ling
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371
Gyanendra K. Verma
Gyanendra K. Verma
Postdoctoral Fellow
Coding TheoryCryptography