WebNov 2, 2024 · A pair of linear codes (C, D) of length n over $$\\mathbb {F}_q$$ F q is called a linear complementary pair (LCP) if their direct sum yields the full space $$\\mathbb {F}_q^n$$ F q n . By a result of Carlet et al. (2024), the best security parameters of binary LCPs of codes are left open. Motivated by this, we study binary LCPs of codes. We … WebThe generator polynomial of the BCH code is defined as the least common multiple g(x) = lcm (m1(x),…,md − 1(x)) . It can be seen that g(x) is a polynomial with coefficients in GF …
Two Families of LCD BCH Codes IEEE Journals & Magazine - IEEE …
WebDec 1, 2024 · Binary primitive LCD BCH codes Xinmei Huang 1,2 · Qin Yue 2,3 · Yansheng Wu 4 · Xiaoping Shi 5 · Jerod Michel 6 Received: 7 April 2024 / Revised: 10 … WebMar 7, 2024 · A BCH code of length n over Fq is always relative to an n-th primitive root of unity β in an extension field of Fq, and is called a dually-BCH code if its dual is also a BCH code relative to the ... barberini hotel roma
Ternary Primitive LCD BCH codes - aimsciences.org
Webhave advantages in constructing binary LCD BCH codes. As a continue work, in this paper we focus on ternary linear codes. Firstly, we find the largest, second largest, and third largest absolute coset leaders of ternary primitive BCH codes. Secondly, we present three classes of ternary primitive BCH codes and determine their weight distributions. WebA t-error-correcting binary BCH code is capable of correcting any combination of t or fewer errors in a block of n = 2m-1 digits. For any positive integer m ≥3 and t < 2m-1, there exists a binary BCH code with the following parameters: Block length: n = 2m - 1 Number of information bits: k≥ n-m*t Minimum distance: d min ≥ 2t + 1. WebJan 1, 2024 · Abstract. In this paper, we study LCD BCH codes over the finite field GF (q) with two types of lengths n, where n = ql + 1 and n = (ql + 1)/ (q + 1). Several classes of LCD BCH codes are given and ... barberini maler