THREE FAMILIES OF BINARY CYCLIC CODES WITH GOOD LOWER BOUNDS

被引：0

作者：

Sun, Zhonghua ^{[1
]}

Li, Ling ^{[1
]}

机构：

[1] Hefei Univ Technol, Sch Math, Hefei 230601, Anhui, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2025年

基金：

中国国家自然科学基金;

关键词：

Cyclic code; BCH bound; Square-root bound; QUANTUM-ERROR-CORRECTION;

D O I：

10.3934/amc.2025006

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

. Constructing an infinite family of binary cyclic codes with good parameters is an interesting topic. The objective of this paper is to construct several families of binary cyclic codes with a square-root-like lower bound. An infinite family of binary cyclic codes of length 2m - 1 and minimum distance m & RightFloor; + 2 is presented. Several infinite families of binary duadic codes with variable length and have a square-root-like lower bound are constructed. As a by-product, several families of binary self-dual codes with a square-rootlike lower bound are presented. These families of binary cyclic codes contain optimal linear codes.

引用

页数：19