A new class of optimal binary linear complementary pairs of codes
cs.IT, math.IT
Submitted: 2026-11-01
Updated: 2026-11-01
Comments: 31 pages, accepted by SETA 2026
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory.
Terminology
Abstract
The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory. Based on the Belov codes, this paper proposes a novel construction of optimal binary LCPs with θ=4, extending our previous work on θ=3. Our results not only yield abundant new optimal binary LCPs with flexible parameters, but also enable more optimal binary LCPs with smaller minimum distances.
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound