A new class of optimal binary linear complementary pairs of codes
Yansheng Wu, Jing Chen
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.
Create a lesson
Related papers
Optimal Communication for Distributed Sparse Histogram Aggregation
Fangwei Ye, Yijun Fan
Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders
Mohsen Moradi, Vahid Nourozi, Wei Tang et al.
Making Every Edit Count: Efficient Binary Edit Correction at the Gilbert-Varshamov Bound
Ryan Gabrys, Shubhransh Singhvi, Eitan Yaakobi
Timely Ground-Station Status Delivery via UAV-Assisted Data Collection and Hierarchical RL
Xiangjian Gao, Mohammad Moltafet, Hamid R. Sadjadpour
Uniform Sampling of Linear Codes with Prescribed Hull Dimension
Keita Ishizuka
Quantum Private Information Retrieval on Forests
Mohamed Nomeir, Sennur Ulukus