140 results
Search Results
2. BCH codes with larger dimensional hull.
- Author
-
Pang, Binbin, Zhu, Shixin, Yang, Tian, and Gao, Jun
- Subjects
LINEAR codes ,CYCLIC codes - Abstract
Hulls of linear codes are widely studied due to their good properties and wide applications. Let n = q m - 1 r and C be an [n, k] cyclic code over F q , where r | q - 1 . In this paper, we present several necessary and sufficient conditions for BCH codes of length n that have k - 1 or k ⊥ - 1 dimensional hulls, where k ⊥ is the dimension of C ⊥ . Further, we give the parameters of several families of self-orthogonal codes that arise as hulls of BCH codes. We obtain many optimal codes. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Entanglement-Assisted Quantum Codes from Cyclic Codes.
- Author
-
Pereira, Francisco Revson F. and Mancini, Stefano
- Subjects
REED-Solomon codes ,CYCLIC codes - Abstract
Entanglement-assisted quantum-error-correcting (EAQEC) codes are quantum codes which use entanglement as a resource. These codes can provide better error correction than the (entanglement unassisted) codes derived from the traditional stabilizer formalism. In this paper, we provide a general method to construct EAQEC codes from cyclic codes. Afterwards, the method is applied to Reed–Solomon codes, BCH codes, and general cyclic codes. We use the Euclidean and Hermitian construction of EAQEC codes. Three families have been created: two families of EAQEC codes are maximal distance separable (MDS), and one is almost MDS or almost near MDS. The comparison of the codes in this paper is mostly based on the quantum Singleton bound. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. LCD codes over finite fields.
- Author
-
Zoubir, N., Guenda, Kenza, Seneviratne, Padmapani, and Aaron Gulliver, T.
- Subjects
- *
AUTOMORPHISM groups , *FINITE fields , *TWO-dimensional bar codes , *BIPARTITE graphs , *FAMILIES - Abstract
In this paper, we introduce several new construction techniques of linear complimentary dual (LCD) codes. First, we show that if a LCD code is fixed by a transitive automorphism group, then the punctured code is also LCD. We show that several important families such as anti-primitive BCH codes and extended Gabidulin codes are LCD. Finally relationships among self-dual codes, λ-orthogonal matrices and LCD codes are studied. As an application we give LCD codes from Paley-type bipartite graph and from punctured MacDonalds codes. Further, we give a bound on some LCD codes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. On the Covering Radius of Small Codes Versus Dual Distance.
- Author
-
Bazzi, Louay
- Subjects
LINEAR codes ,RADIAL bone ,CORPORATE distributions ,THETA series ,AUTHORS - Abstract
Tietäväinen’s upper and lower bounds assert that for block-length- $n$ linear codes with dual distance $d$ , the covering radius $R$ is at most $({n}/{2})-(({1}/{2})-o(1))\sqrt {dn}$ and typically at least $({n}/{2})-\Theta (({dn\log {({n}/{d})}})^{1/2})$. The gap between those bounds on $R -({n}/{2})$ is a $\Theta (({\log {({n}/{d})}})^{1/2})$ factor related to the gap between the worst covering radius given $d$ and the sphere-covering bound. Our focus in this paper is on the case when $d = o(n)$ , i.e., when the code size is subexponential and the gap is $w(1)$. We show that up to a constant, the gap can be eliminated by relaxing the covering requirement to allow for missing $o(1)$ fraction of points. Namely, if the dual distance $d = o(n)$ , then for sufficiently large $d$ , almost all points can be covered with radius $R\leq ({n}/{2})-\Theta (({dn\log {({n}/{d})}})^{1/2})$. Compared with random linear codes, our bound on $R-({n}/{2})$ is asymptotically tight up to a factor less than 3. We give applications to dual-BCH codes. The proof builds on the author’s previous work on the weight distribution of cosets of linear codes, which we simplify in this paper and extend from codes to probability distributions on $\{0,1\}^{n}$ , thus enabling the extension of the earlier result to $(d-1)$ -wise independent distributions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
6. LCD Cyclic Codes Over Finite Fields.
- Author
-
Li, Chengju, Ding, Cunsheng, and Li, Shuxing
- Subjects
BCH codes ,CYCLIC codes ,FINITE fields ,CYCLOTOMIC fields ,LINEAR programming - Abstract
In addition to their applications in data storage, communications systems, and consumer electronics, linear complementary dual (LCD) codes—a class of linear codes—have been employed in cryptography recently. LCD cyclic codes were referred to as reversible cyclic codes in the literature. The objective of this paper is to construct several families of reversible cyclic codes over finite fields and analyze their parameters. The LCD cyclic codes presented in this paper have very good parameters in general, and contain many optimal codes. A well rounded treatment of reversible cyclic codes is also given in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
7. On the parameters of a class of narrow sense primitive BCH codes.
- Author
-
Mouloua, El Mahdi and Najmeddine, M.
- Subjects
COMPACT discs ,TELECOMMUNICATION satellites ,CYCLIC codes ,SENSES - Abstract
The last few decades have seen an increase in the determination of the parameters of the primitive BCH codes. Indeed, BCH codes are powerful in terms of encoding and decoding. They are applied in several fields such as: satellite communications, cryptography, compact disk drives etc, and have good structural properties. Nevertheless, the dimension and the minimum distance of those codes are not known in general. In this paper, we present a class of narrow sense primitive BCH codes of designed distance .... Also, we investigate their Bose distance and dimension. [ABSTRACT FROM AUTHOR]
- Published
- 2023
8. A generalized approach for the fuzzy commitment scheme.
- Author
-
Chauhan, Sonam and Sharma, Ajay
- Subjects
INFORMATION & communication technologies ,CORRUPTION ,WITNESSES ,CIPHERS ,SCHEME liability - Abstract
Commitment Scheme is the way to hide the information and that information is revealed to the receiver in the later stage. The commitment scheme uses witness value to open the commitment. The role of witness value differentiates the fuzzy commitment scheme from a commitment scheme. Fuzzy commitment scheme allows the use of corrupted witness. In this paper, a generalized fuzzy commitment scheme is introduced that has the capability to reconstruct the secret from corrupted committed message and corrupted witness. The paper presents the fuzzy commitment scheme with the codes and analyzes the scheme with BCH and RS codes. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. Narrow-Sense BCH Codes Over \mathrm GF(q) With Length n=\frac q^m-1q-1.
- Author
-
Li, Shuxing, Ding, Cunsheng, Xiong, Maosheng, and Ge, Gennian
- Subjects
CYCLIC codes ,QUADRATIC forms ,BCH codes ,DECODING algorithms ,TELECOMMUNICATION systems - Abstract
Cyclic codes are widely employed in communication systems, storage devices, and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over \mathrm GF(q) with length n=(q^m-1)/(q-1) . Little is known about this class of BCH codes when $q>2$ . The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length n=(3^{m}-1)/2 are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
10. Parameters of Several Classes of BCH Codes.
- Author
-
Ding, Cunsheng
- Subjects
BCH codes ,TELECOMMUNICATION systems ,COMPUTER storage devices ,HOUSEHOLD electronics ,INFORMATION theory - Abstract
Because of their efficient encoding and decoding algorithms, cyclic codes—an interesting class of linear codes—are widely used in communication systems, storage devices, and consumer electronics. BCH codes form a special class of cyclic codes, and are usually among the best cyclic codes. A subclass of good BCH codes is the narrow-sense primitive BCH codes. However, the dimension and minimum distance of these codes are not known in general. The main objective of this paper is to study the dimension and minimum distances of a subclass of the narrow-sense primitive BCH codes with design distance \delta =(q-\ell 0)q^{m-\ell 1-1}-1 for certain pairs (\ell 0, \ell 1) , where 0 \leq \ell 0 \leq q-2 and 0 \leq \ell 1 \leq m-1 . The parameters of other related classes of BCH codes are also investigated, and some open problems are proposed in this paper. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
11. A Class of Narrow-Sense BCH Codes.
- Author
-
Zhu, Shixin, Sun, Zhonghua, and Kai, Xiaoshan
- Subjects
TWO-dimensional bar codes ,CYCLIC codes ,LINEAR codes ,TELECOMMUNICATION satellites ,DVD-Video discs ,CIPHERS - Abstract
BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. made some new progress in BCH codes. However, we still have very limited knowledge on the dimension of BCH codes, not to mention the weight distribution of BCH codes. In this paper, we generalize the results on BCH codes from several previous papers. 1) The dimension of narrow-sense BCH codes of length $((q^{m}-1)/{\lambda })$ with designed distance $2\leq \delta \leq (({q^{\lceil (m+1)/2 \rceil }-1})/(\lambda)+1)$ is settled, where $\lambda $ is any factor of $(q-1)$. 2) The weight distributions of two classes of narrow-sense BCH codes of length $(({q^{m}-1})/2)$ with designed distance $\delta =(({(q-1)q^{m-1}-q^{\lfloor (m-1)/2\rfloor }-1})/2)$ and $\delta =(({(q-1)q^{m-1}-q^{\lfloor (m+1)/2\rfloor }-1})/2)$ are determined. 3) The weight distribution of a class of BCH codes of length $((q^{m}-1)/({q-1}))$ is determined. In particular, a subclass of this class of BCH codes is optimal with respect to the Griesmer bound. Some optimal linear codes obtained from this class of BCH codes are characterized. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
12. Block Markov Superposition Transmission of BCH Codes With Iterative Erasures-and-Errors Decoders.
- Author
-
Cai, Suihua, Lin, Nina, and Ma, Xiao
- Subjects
DATA transmission systems ,LINEAR codes ,ITERATIVE methods (Mathematics) ,BIT error rate ,MATHEMATICAL bounds ,NUMERICAL analysis - Abstract
In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicted by the proposed genie-aided lower bounds, while the waterfall performance can be analyzed by the density evolution method. To evaluate the error floor of the constructed BMST-BCH codes at a very low bit error rate (BER) region, we propose a fast simulation approach. Numerical results show that, at a target BER of $10^{-15}$ , the proposed BMST-BCH code with hard-decision can achieve a net coding gain (NCG) of 10.55 dB with 25% overhead, while a soft-decision design can yield an NCG of 10.74 dB. The construction of BMST-BCH codes is flexible to trade off latency against performance at all overheads of interest and may find applications in optical transport networks as an attractive candidate. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
13. New quantum stabilizer codes with better parameters from the images of some RS codes and BCH codes.
- Author
-
Wang, Xueting, Yan, Tongjiang, Sun, Yuhua, and Wang, Tao
- Abstract
This paper contributes to constructing some good quantum stabilizer codes by the images of cyclic codes of length q 2 m - 1 and r (q 2 - 1) , respectively, where m and r are positive integers. The construction produces some quantum stabilizer codes with larger minimum distances or better code rate than the previously known ones and some quantum stabilizer codes with the new length m (q 2 m - 1) . [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
14. Some new classes of quantum BCH codes.
- Author
-
Zhang, Jiayuan, Li, Ping, Kai, Xiaoshan, and Zhu, Shixin
- Subjects
DECODING algorithms ,DATA warehousing ,TELECOMMUNICATION systems ,LINEAR codes ,INTEGERS - Abstract
Due to efficient encoding and decoding algorithms, BCH codes have many applications in data storage systems and satellite communications. Meanwhile, one advantage of BCH codes is to construct quantum codes. In this paper, we assume that q ≡ 1 mod m , where m is a positive integer. We first study a class of q - ary quantum codes of length r (q m - 1) q - 1 by CSS construction, where r ∣ q - 1 . Then, we construct two families of q - ary quantum codes of length r (q 2 m - 1) q 2 - 1 by Hermitian construction. These constructions produce new quantum codes with larger dimensions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Steganalysis of BCH code based stego schemes.
- Author
-
Natarajan, V. and Anitha, R.
- Subjects
TELECOMMUNICATION ,CODING theory ,INFORMATION theory ,DIGITAL electronics ,ERRORS - Abstract
The class of stego systems based on error correcting codes is one of the alternatives to conventional steganographic systems. In the context of code based steganography, the BCH code based stego system offers a very smart solution based on the hardness of syndrome decoding. It has been shown that syndrome decoding problem is able to resist the existing steganalysis attacks. In this paper, we introduce an attack against these systems using a new syndrome decoding method. This scheme also generates a direct estimate of the secret message bit locations by exploiting the embedding patterns. This new attack notably points out that BCH code based stego system with its original parameters do not provide sufficient security. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
16. Two Classes of Quantum Synchronizable Codes.
- Author
-
Li, Zheng and Zhu, Shixin
- Abstract
Quantum synchronizable codes(QSCs) are special classes of quantum error-correcting codes that can correct not only the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, we construct two classes of QSCs from cyclic codes. The first class is to construct cyclic and negacyclic codes of odd prime length by using cyclotomic polynomials, and obtain a class of QSCs which achieves the best attainable misalignment under certain conditions. The second class is to apply BCH codes and negacyclic BCH codes on (u + v)|(u − v) structure to construct a class of QSCs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. Step-by-Step Decoding of Binary Quasi-Reversible BCH Codes.
- Abstract
Binary quasi-reversible BCH codes whose defining set contains consecutive elements from negative to positive integers have received considerable attention in recent years due to their efficient decoding suitable for a wide range of applications. This paper combines the concept of the weight and quasi-reversible structures to introduce two subclasses of BCH codes: odd-like/even-like quasi-reversible BCH codes. The step-by-step decoding of these codes is developed as follows: First, the weight evaluation of a received polynomial is able to judge whether the number of errors is odd or even, which helps to simplify the decoding processes. Second, based on Chiò’s pivotal condensation process which can be easily implemented in a parallel computing architecture, the determinant calculation of the band matrix instead of Peterson’s matrix in column-echelon form is faster. Third, a newly proposed non-monic error-locator polynomial is sparser than the conventional ones. As a consequence, the theoretical analysis and experimental results validate potential benefits in requiring fewer finite field additions and multiplications used in the decoding of binary odd-like/even-like quasi-reversible BCH codes up to half the minimum distance when compared with the narrow-sense BCH codes with small error-correcting capability. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. On Decoding Binary Quasi-Reversible BCH Codes.
- Author
-
Lin, Tsung-Ching, Lee, Chong-Dao, Chang, Yaotsu, and Truong, Trieu-Kien
- Subjects
MATRIX multiplications ,LINEAR systems ,ERROR-correcting codes ,COMPUTATIONAL complexity ,DECODING algorithms ,COMPUTER simulation ,MATRIX decomposition - Abstract
For the recently developed quasi-reversible BCH codes with long lengths and high error-correcting capability, this paper is aimed at proposing a new and faster decoding procedure. It consists of four steps: 1) compute the consecutive syndromes; 2) calculate the syndrome functions by the forward and backward recursions; 3) solve a linear subsystem together with one matrix multiplication in order to find an error-locator polynomial; 4) determine the errors from the obtained polynomial by using the root-finding algorithm. This procedure, especially in Steps 2 and 3, differs greatly from the conventional procedures, which determine an error-locator polynomial directly from solving a linear system with the aid of the consecutive syndromes. The key idea behind this decoding technique is that the computational complexity of such a small subsystem instead of an originally large linear system can be significantly reduced, although there are additional forward and backward syndrome calculations with low complexity increasing. Finally, the illustrative examples and numerical simulations can be helpful to demonstrate the accuracy and efficacy of the presented decoding technique at different error-correcting capabilities. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. A new efficient way based on special stabilizer multiplier permutations to attack the hardness of the minimum weight search problem for large BCH codes.
- Author
-
Joundan, Issam Abderrahman, Nouh, Said, Azouazi, Mohamed, and Namir, Abdelwahed
- Subjects
MULTIPLIERS (Mathematical analysis) ,CRYPTOSYSTEMS ,ERROR-correcting codes ,PUBLIC key cryptography ,CYCLIC codes ,CODING theory ,PERMUTATIONS - Abstract
BCH codes represent an important class of cyclic error-correcting codes; their minimum distances are known only for some cases and remains an open NP-Hard problem in coding theory especially for large lengths. This paper presents an efficient scheme ZSSMP (Zimmermann Special Stabilizer Multiplier Permutation) to find the true value of the minimum distance for many large BCH codes. The proposed method consists in searching a codeword having the minimum weight by Zimmermann algorithm in the sub codes fixed by special stabilizer multiplier permutations. These few sub codes had very small dimensions compared to the dimension of the considered code itself and therefore the search of a codeword of global minimum weight is simplified in terms of run time complexity. ZSSMP is validated on all BCH codes of length 255 for which it gives the exact value of the minimum distance. For BCH codes of length 511, the proposed technique passes considerably the famous known powerful scheme of Canteaut and Chabaud used to attack the public-key cryptosystems based on codes. ZSSMP is very rapid and allows catching the smallest weight codewords in few seconds. By exploiting the efficiency and the quickness of ZSSMP, the true minimum distances and consequently the error correcting capability of all the set of 165 BCH codes of length up to 1023 are determined except the two cases of the BCH(511,148) and BCH(511,259) codes. The comparison of ZSSMP with other powerful methods proves its quality for attacking the hardness of minimum weight search problem at least for the codes studied in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. Decoding of Interleaved Alternant Codes.
- Author
-
Holzbaur, Lukas, Liu, Hedongliang, Neri, Alessandro, Puchinger, Sven, Rosenkilde, Johan, Sidorenko, Vladimir, and Wachter-Zeh, Antonia
- Subjects
DECODING algorithms ,REED-Solomon codes - Abstract
Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed–Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed–Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of error matrices decodable by Schmidt et al.’s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
21. Apparent Distance and a Notion of BCH Multivariate Codes.
- Author
-
Bernal, Jose Joaquin, Bueno-Carreno, Diana H., and Simon, Juan Jacobo
- Subjects
BCH codes ,CYCLIC codes ,CODING theory ,INFORMATION theory ,ERROR-correcting codes - Abstract
This paper is devoted to studying two main problems: 1) computing the apparent distance of an Abelian code and 2) giving a notion of Bose, Ray-Chaudhuri, Hocquenghem (BCH) multivariate code. To do this, we first strengthen the notion of an apparent distance by introducing the notion of a strong apparent distance; then, we present an algorithm to compute the strong apparent distance of an Abelian code, based on some manipulations of hypermatrices associated with its generating idempotent. Our method uses less computations than those given by Camion and Sabin; furthermore, in the bivariate case, the order of computation complexity is reduced from exponential to linear. Then, we use our techniques to develop a notion of a BCH code in the multivariate case, and we extend most of the classical results on cyclic BCH codes. Finally, we apply our method to the design of Abelian codes with maximum dimension with respect to a fixed apparent distance and a fixed length. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
22. The Bose and Minimum Distance of a Class of BCH Codes.
- Author
-
Ding, Cunsheng, Du, Xiaoni, and Zhou, Zhengchun
- Subjects
BCH codes ,ERROR-correcting codes ,CYCLIC codes ,POLYNOMIALS ,EMAIL systems - Abstract
Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms. Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices, and consumer electronics. However, the dimension and minimum distance of BCH codes are not known in general. The objective of this paper is to determine the Bose and minimum distances of a class of narrow-sense primitive BCH codes. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
23. Dimensioning BCH Codes for Coherent DQPSK Systems With Laser Phase Noise and Cycle Slips.
- Author
-
Miu Yoong Leong, Larsen, Knud J., Jacobsen, Gunnar, Popov, Sergei, Zibar, Darko, and Sergeyev, Sergey
- Abstract
Forward error correction (FEC) plays a vital role in coherent optical systems employing multi-level modulation. However, much of coding theory assumes that additive white Gaussian noise (AWGN) is dominant, whereas coherent optical systems have significant phase noise (PN) in addition to AWGN. This changes the error statistics and impacts FEC performance. In this paper, we propose a novel semianalytical method for dimensioning binary Bose-Chaudhuri-Hocquenghem (BCH) codes for systems with PN. Our method involves extracting statistics from pre-FEC bit error rate (BER) simulations. We use these statistics to parameterize a bivariate binomial model that describes the distribution of bit errors. In this way, we relate pre-FEC statistics to post-FEC BER and BCH codes. Our method is applicable to pre-FEC BER around 10-3 and any post-FEC BER. Using numerical simulations, we evaluate the accuracy of our approach for a target post-FEC BER of 10-5. Codes dimensioned with our bivariate binomial model meet the target within 0.2-dB signal-to-noise ratio. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
24. A class of primitive BCH codes and their weight distribution.
- Author
-
Yan, Haode
- Subjects
BCH codes ,DISTRIBUTION (Probability theory) ,SET theory ,PROBLEM solving ,FINITE fields - Abstract
BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. Recently, several classes of BCH codes with length $$n=q^m-1$$ and designed distances $$\delta =(q-1)q^{m-1}-1-q^{\lfloor (m-1)/2\rfloor }$$ and $$\delta =(q-1)q^{m-1}-1-q^{\lfloor (m+1)/2\rfloor }$$ were widely studied, where $$m\ge 4$$ is an integer. In this paper, we consider the case $$m=3$$ . The weight distribution of a class of primitive BCH codes with designed distance $$q^3-q^2-q-2$$ is determined, which solves an open problem put forward in Ding et al. (Finite Fields Appl 45:237-263, 2017). [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
25. Two Families of LCD BCH Codes.
- Author
-
Li, Shuxing, Li, Chengju, Ding, Cunsheng, and Liu, Hao
- Subjects
BCH codes ,LIQUID crystal displays ,LINEAR codes ,EMAIL systems ,BINARY codes - Abstract
Historically, LCD cyclic codes were referred to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD codes. In this paper, we explore two special families of LCD cyclic codes, which are both BCH codes. The dimensions and the minimum distances of these LCD BCH codes are investigated. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
26. Impact of Error Control Code on Characteristic Distance in Wireless Sensor Network.
- Author
-
Chowdhury, Sultan, Hossain, Ashraf, and Debnath, Sunandita
- Subjects
WIRELESS sensor networks ,ERROR-correcting codes ,TELECOMMUNICATION system energy consumption ,BCH codes ,REED-Solomon codes - Abstract
In this paper we study the impact of error control code (ECC) on characteristic distance in wireless sensor network (WSN). In WSN nodes are energy constrained and the goal is to design an energy efficient network. Characteristic distance is important for such network. We consider Bose, Chaudhuri and Hocquenghem and Reed-Solomon codes with different error correction capabilities. Characteristic distance is studied for single node and all nodes transmitting case when decoding is done at all intermediate nodes and only at the destination node. The results show that there is significant improvement in characteristic distance when decoding is done at all intermediate nodes. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
27. On the direct construction of recursive MDS matrices.
- Author
-
Gupta, Kishan, Pandey, Sumit, and Venkateswarlu, Ayineedi
- Subjects
SINGLETON bounds ,CODING theory ,CRYPTOGRAPHY ,COMPUTATIONAL complexity ,POLYNOMIALS - Abstract
MDS matrices allow to build optimal linear diffusion layers in the design of block ciphers and hash functions. There has been a lot of study in designing efficient MDS matrices suitable for software and/or hardware implementations. In particular recursive MDS matrices are considered for resource constrained environments. Such matrices can be expressed as a power of simple companion matrices, i.e., an MDS matrix $$M = C_g^k$$ for some companion matrix corresponding to a monic polynomial $$g(X) \in \mathbb {F}_q[X]$$ of degree k. In this paper, we first show that for a monic polynomial g( X) of degree $$k\ge 2$$ , the matrix $$M = C_g^k$$ is MDS if and only if g( X) has no nonzero multiple of degree $$\le 2k-1$$ and weight $$\le k$$ . This characterization answers the issues raised by Augot et al. in FSE-2014 paper to some extent. We then revisit the algorithm given by Augot et al. to find all recursive MDS matrices that can be obtained from a class of BCH codes (which are also MDS) and propose an improved algorithm. We identify exactly what candidates in this class of BCH codes yield recursive MDS matrices. So the computation can be confined to only those potential candidate polynomials, and thus greatly reducing the complexity. As a consequence we are able to provide formulae for the number of such recursive MDS matrices, whereas in FSE-2014 paper, the same numbers are provided by exhaustively searching for some small parameter choices. We also present a few ideas making the search faster for finding efficient recursive MDS matrices in this class. Using our approach, it is possible to exhaustively search this class for larger parameter choices which was not possible earlier. We also present our search results for the case $$k=8$$ and $$q=2^{16}$$ . [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
28. BCH Codes for the Rosenbloom–Tsfasman Metric.
- Author
-
Zhou, Wei, Lin, Shu, and Abdel-Ghaffar, Khaled A. S.
- Subjects
BCH codes ,CYCLIC codes ,HASSE diagrams ,GRAPHIC methods for partially ordered sets ,HAMMING codes - Abstract
The Rosenbloom–Tsfasman metric has attracted the attention of many researchers as a generalization of the Hamming metric that is relevant to practical problems. Codes for this metric were considered. In particular, Reed–Solomon codes were generalized to be compatible with this metric. In this paper, a generalization of BCH codes for the Rosenbloom–Tsfasman metric is proposed. This generalization is based on considering BCH codes as subfield subcodes of Reed–Solomon codes. By characterizing these subfield subcodes, an explicit construction of BCH codes for the Rosenbloom–Tsfasman metric is provided. Two important properties of Reed–Solomon codes and BCH codes for the Rosenbloom–Tsfasman metric are studied and compared with those for the Hamming metric. These properties are cyclic structure and duality. The approach is based on Galois-Fourier transforms associated with Hasse derivatives. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
29. Interleaved Concatenations of Polar Codes With BCH and Convolutional Codes.
- Author
-
Wang, Ying, Narayanan, Krishna R., and Huang, Yu-Chih
- Subjects
BCH codes ,SIGNAL-to-noise ratio ,BIT rate ,SIGNAL convolution ,ITERATIVE decoding ,POLARIZATION (Electricity) - Abstract
We analyze interleaved concatenation schemes of polar codes with outer binary BCH codes and convolutional codes. We show that both BCH-polar and Conv-polar codes can have a frame error rate that decays exponentially with the code length for all rates up to capacity, which is a substantial improvement in the error exponent over stand-alone polar codes. Interleaved concatenation with long constraint length convolutional codes is an effective way to leverage the fact that polarization increases the cutoff rate of the channel. Simulation results show that Conv-polar codes when decoded with the proposed soft-output multistage iterative decoding algorithm can outperform stand-alone polar codes decoded with successive cancellation or belief propagation decoding. It may be comparable to stand-alone polar codes with list decoding in the high SNR regime. In addition to this, we show that the proposed concatenation scheme requires lower memory and decoding complexity in comparison to belief propagation and list decoding of polar codes. Practically, the scheme enables rate compatible outer codes which ease hardware implementation. Our results suggest that the proposed method may strike a better balance between performance and complexity compared to existing methods in the finite-length regime. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
30. Analysis and performance evaluation of new coding options for space telecommand links - part II: jamming channels.
- Author
-
Baldi, M., Chiaraluce, F., Garello, R., Maturo, N., Aguilar Sanchez, I., and Cioni, S.
- Subjects
TELECOMMUNICATION satellites ,EARTH stations ,RADAR interference ,SPREAD spectrum communications ,TELECOMMUNICATION systems - Abstract
In this paper, we study the performance of telecommand space links affected by pulsed, continuous wave and pseudo-noise jamming. Countermeasures include coding, interleaving, and direct sequence spread spectrum. Binary and non-binary low-density parity-check codes, parallel turbo codes, and soft-decision decoded BCH codes are considered. We investigate the impact of different decoding algorithms, also taking into account the role of jamming state information, spreading processing gain and interleaving. The results show that significant gains (up to more than 10 dB) can be achieved in a number of interesting scenarios. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
31. On Two Classes of Primitive BCH Codes and Some Related Codes.
- Author
-
Li, Chengju, Wu, Peng, and Liu, Fengmei
- Subjects
BCH codes ,CODING theory ,MATHEMATICAL bounds ,INFORMATION storage & retrieval systems ,CRYPTOGRAPHY - Abstract
BCH codes are an interesting type of cyclic codes and have wide applications in communication and storage systems. Generally, it is very hard to determine the minimum distances of BCH codes. In this paper, we determine the weight distributions of two classes of primitive BCH codes $\mathcal C_{(q, m, \delta _{2})}$ and $\mathcal C_{(q, m, \delta _{3})}$ and their extended codes, which solve two problems proposed by Ding et al. It is shown that the extended codes $\overline {\mathcal C}_{(q, m, \delta _{2})}$ have four nonzero weights. We also employ the Hartmann-Tzeng bound to present the minimum distance of the dual code $\mathcal C_{(q, m, \delta _{2})}^\perp $ for $q \ge 5$. Inspired by the idea, we then determine the dimensions of a class of cyclic codes and give lower bounds on their minimum distances, which is greatly improved comparing with the BCH bound. Some optimal codes are obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
32. Entanglement-Assisted Quantum Negacyclic BCH Codes.
- Author
-
Chen, Xiaojing, Zhu, Shixin, and Kai, Xiaoshan
- Subjects
QUANTUM error correcting codes ,LINEAR codes ,NANOELECTRONICS ,QUANTUM cryptography - Abstract
The entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and important class of quantum codes. The entanglement-assisted formalism can transform arbitrary classical linear codes into EAQECCs by using pre-shared entanglement between the sender and the receiver. In this paper, by decomposing the defining set of negacyclic BCH codes, we construct a class of new EAQECCs with length n = q 4 m − 1 q 2 − 1 . [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
33. Some Families of Quantum BCH Codes.
- Author
-
Zhang, Ming, Li, Zhuo, Xing, Lijuan, and Tang, Nianqi
- Subjects
QUANTUM information science ,HERMITIAN structures ,QUANTUM communication ,QUANTUM entanglement ,CYCLOTOMIC fields - Abstract
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes over finite fields have been studied extensively. The Calderbank-Shor-Steane (CSS) construction, especially Steane's enlargement, and Hermitian construction are the most widely used methods in design of quantum codes. The BCH codes containing their Euclidean dual or Hermitian dual codes can be used to generate good stabilizer codes. Therefore, we can construct quantum codes by classical BCH codes over finite fields in this paper. Firstly, we study the properties of such classical BCH codes in terms of the cyclotomic cosets. It is convenient to compute the dimension of new quantum BCH codes. Meanwhile, it ensures that classical BCH codes are Euclidean dual-containing or Hermitian dual-containing. These results about suitable cyclotomic cosets make it possible to construct several new families of nonbinary quantum BCH codes with a given parameter set. Compared with the ones available in the literature, the quantum BCH codes in our schemes have good parameters. In particular, we extend to more general cases than known results. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
34. A class of negacyclic BCH codes and its application to quantum codes.
- Author
-
Zhu, Shixin, Sun, Zhonghua, and Li, Ping
- Subjects
BCH codes ,CYCLIC codes ,LINEAR codes ,QUANTUM error correcting codes ,INTEGERS - Abstract
In this paper, we study negacyclic BCH codes over Fq
of length n=(q2m-1)/(q-1) , where q is an odd prime power and m is a positive integer. In particular, the dimension, the minimum distance and the weight distribution of some negacyclic BCH codes over Fq of length n=(q2m-1)/(q-1) are determined. Two classes of negacyclic BCH codes meeting the Griesmer bound are obtained. As an application, we construct quantum codes with good parameters from this class of negacyclic BCH codes. [ABSTRACT FROM AUTHOR] - Published
- 2018
- Full Text
- View/download PDF
35. Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes
- Author
-
Wang, Liqi, Sun, Zhonghua, and Zhu, Shixin
- Published
- 2019
- Full Text
- View/download PDF
36. Towards a general construction of recursive MDS diffusion layers
- Author
-
Gupta, Kishan Chand, Pandey, Sumit Kumar, and Venkateswarlu, Ayineedi
- Published
- 2017
- Full Text
- View/download PDF
37. Entanglement-Assisted Quantum Codes from Cyclic Codes
- Author
-
Francisco Revson F. Pereira and Stefano Mancini
- Subjects
quantum codes ,Reed–Solomon codes ,BCH codes ,maximal distance separable ,maximal entanglement ,Science ,Astrophysics ,QB460-466 ,Physics ,QC1-999 - Abstract
Entanglement-assisted quantum-error-correcting (EAQEC) codes are quantum codes which use entanglement as a resource. These codes can provide better error correction than the (entanglement unassisted) codes derived from the traditional stabilizer formalism. In this paper, we provide a general method to construct EAQEC codes from cyclic codes. Afterwards, the method is applied to Reed–Solomon codes, BCH codes, and general cyclic codes. We use the Euclidean and Hermitian construction of EAQEC codes. Three families have been created: two families of EAQEC codes are maximal distance separable (MDS), and one is almost MDS or almost near MDS. The comparison of the codes in this paper is mostly based on the quantum Singleton bound.
- Published
- 2022
- Full Text
- View/download PDF
38. New quantum codes derived from a family of antiprimitive BCH codes.
- Author
-
Yang Liu, Ruihu Li, Liangdong Lü, and Luobin Guo
- Subjects
BCH codes ,QUANTUM information theory ,CYCLOTOMIC fields ,HERMITIAN structures ,SET theory - Abstract
The Bose-Chaudhuri-Hocquenghem (BCH) codes have been studied for more than 57 years and have found wide application in classical communication system and quantum information theory. In this paper, we study the construction of quantum codes from a family of q²-ary BCH codes with length n = q
2m + 1 (also called antiprimitive BCH codes in the literature), where q ≥ 4 is a power of 2 and m ≥ 2. By a detailed analysis of some useful properties about q²-ary cyclotomic cosets modulo n, Hermitian dual-containing conditions for a family of non-narrowsense antiprimitive BCH codes are presented, which are similar to those of q²-ary primitive BCH codes. Consequently, via Hermitian Construction, a family of new quantum codes can be derived from these dual-containing BCH codes. Some of these new antiprimitive quantum BCH codes are comparable with those derived from primitive BCH codes. [ABSTRACT FROM AUTHOR]- Published
- 2017
- Full Text
- View/download PDF
39. Algebraic quantum synchronizable codes.
- Author
-
Guenda, K., Guardia, G., and Gulliver, T.
- Abstract
In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of Fujiwara (Phys. Rev. A 87(02): 23-44, 2013) can be generalized to repeated root cyclic codes such that QSCs are always obtained, which is not the case with simple root cyclic codes. The usefulness of this extension is illustrated via examples of infinite families of QSCs from repeated root duadic codes. Finally, QSCs are constructed from the product of cyclic codes. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
40. Entanglement-assisted quantum codes from quaternary codes of dimension five.
- Author
-
Lu, Liangdong, Li, Ruihu, and Guo, Luobin
- Subjects
CODING theory ,QUATERNARY forms ,ERROR correction (Information theory) ,BCH codes ,JACOBSON radical - Abstract
Maximal-entanglement entanglement-assisted quantum error-correcting codes (EAQE-CCs) can achieve the EA-hashing bound asymptotically and a higher rate and/or better noise suppression capability may be achieved by exploiting maximal entanglement. In this paper, we discussed the construction of quaternary zero radical (ZR) codes of dimension five with length . Using the obtained quaternary ZR codes, we construct many maximal-entanglement EAQECCs with very good parameters. Almost all of these EAQECCs are better than those obtained in the literature, and some of these EAQECCs are optimal codes. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
41. Properties and applications of G-orbits polynomial invariants of errors in reverse codes
- Author
-
Alexander V. Kushnerov and Valery A. Lipnitski
- Subjects
error correcting codes ,code minimal distance ,reverse codes ,bch codes ,norm method of error correction ,Mathematics ,QA1-939 - Abstract
In this paper is described a twostep procedure for polynomialnorm error correction with reverse error correcting codes. Such codes of length n traditionally are defined by check matrix HR = (βi,β−i)T, 0 ≤ i ≤ n – 1, β = α(2m−1)/n and α is primitive element of GF(2m). Also in paper you can find a description of error correction algorithm and an example based on reverse code of length 89.
- Published
- 2019
42. New quantum codes constructed from quaternary BCH codes.
- Author
-
Xu, Gen, Li, Ruihu, Guo, Luobin, and Ma, Yuena
- Subjects
QUANTUM error correcting codes ,BCH codes ,HERMITIAN operators ,QUANTUM information theory ,MATHEMATICAL bounds - Abstract
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
43. New Efficient Scheme Based on Reduction of the Dimension in the Multiple Impulse Method to Find the Minimum Distance of Linear Codes.
- Author
-
Nouh, Said, Abderrahman Joundan, Issam, Aylaj, Bouchaib, Belkasmi, Mostafa, and Namir, Abdelwahed
- Subjects
LINEAR codes ,GROUP codes (Coding theory) ,CODING theory ,INFORMATION theory ,PERMUTATIONS - Abstract
In order to find a minimum weight codeword in a linear code, the Multiple Impulse Method uses the Ordered Statistics Decoder of order 3 having a complexity which increases with the code dimension. This paper presents an important improvement of this method by finding a sub code of C of small dimension containing a lowest weight codeword. In the case of Binary Extended Quadratic Residue codes, the proposed technique consists on finding a self invertible permutation σ from the projective special linear group and searching a codeword having the minimum weight in the sub code fixed by σ. The proposed technique gives the exact value of the minimum distance for all binary quadratic residue codes of length less than 223 by using the Multiple Impulse Method on the sub codes in less than one second. For lengths more than 223, the obtained results prove the height capacity of the proposed technique to find the lowest weight in less time. The proposed idea is generalized for BCH codes and it has permits to find the true value of the minimum distance for some codes of lengths 1023 and 2047. The proposed methods performed very well in comparison to previously known results. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
44. Constructions of Asymmetric Quantum Alternant Codes.
- Author
-
Fan, Jihao, Chen, Hanwu, and Xu, Juan
- Subjects
QUANTUM states ,ALTERNANTS ,QUANTUM error correcting codes ,REED-Solomon codes ,GOPPA codes - Abstract
Asymmetric quantum error-correcting codes (AQCs) have been proposed to deal with the significant asymmetry in many quantum channels, which may have more flexbility than general quantum error-correcting codes (QECs). In this paper, we construct AQCs based on Alternant codes. Firstly, we propose a new subclass of Alternant codes and combine them with BCH codes to construct AQCs. Then we construct AQCs based on series of nested pairs of subclasses of Alternant codes such as nested Goppa codes. As an illustrative example, we get three [[55, 6, 19/4]], [[55, 10, 19/3]], [[55, 15, 19/2]] AQCs from the well known [55, 16, 19] binary Goppa code. At last, we get asymptotically good binary expansions of quantum GRS codes, which are quantum generalizations of Retter's classical results. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
45. Binary primitive LCD BCH codes
- Author
-
Huang, Xinmei, Yue, Qin, Wu, Yansheng, Shi, Xiaoping, and Michel, Jerod
- Published
- 2020
- Full Text
- View/download PDF
46. Decoder architecture for generalised concatenated codes.
- Author
-
Spinner, Jens and Freudenberger, Jürgen
- Abstract
This paper proposes a pipelined decoder architecture for generalised concatenated (GC) codes. These codes are constructed from inner binary Bose–Chaudhuri–Hocquenghem (BCH) and outer Reed–Solomon codes. The decoding of the component codes is based on hard decision syndrome decoding algorithms. The concatenated code consists of several small BCH codes. This enables a hardware architecture where the decoding of the component codes is pipelined. A hardware implementation of a GC decoder is presented and the cell area, cycle counts as well as the timing constraints are investigated. The results are compared to a decoder for long BCH codes with similar error correction performance. In comparison, the pipelined GC decoder achieves a higher throughput and has lower area consumption. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
47. Shared Graph Neural Network for Channel Decoding.
- Author
-
Wu, Qingle, Ng, Benjamin K., Lam, Chan-Tong, Cen, Xiangyu, Liang, Yuanhui, and Ma, Yan
- Subjects
LOW density parity check codes ,DEEP learning ,DECODING algorithms ,MULTIPLICATION - Abstract
With the application of graph neural network (GNN) in the communication physical layer, GNN-based channel decoding algorithms have become a research hotspot. Compared with traditional decoding algorithms, GNN-based channel decoding algorithms have a better performance. GNN has good stability and can handle large-scale problems; GNN has good inheritance and can generalize to different network settings. Compared with deep learning-based channel decoding algorithms, GNN-based channel decoding algorithms avoid a large number of multiplications between learning weights and messages. However, the aggregation edges and nodes for GNN require many parameters, which requires a large amount of memory storage resources. In this work, we propose GNN-based channel decoding algorithms with shared parameters, called shared graph neural network (SGNN). For BCH codes and LDPC codes, the SGNN decoding algorithm only needs a quarter or half of the parameters, while achieving a slightly degraded bit error ratio (BER) performance. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
48. Trends and challenges in design of embedded BCH error correction codes in multi-levels NAND flash memory devices
- Author
-
Saeideh Nabipour, Javad Javidan, and Rolf Drechsler
- Subjects
NAND flash memory ,BCH codes ,BCH decoder ,Hardware complexity ,Low latency ,Electric apparatus and materials. Electric circuits. Electric networks ,TK452-454.4 ,Computer engineering. Computer hardware ,TK7885-7895 - Abstract
Recently, there has been a growing concern regarding the dependability of NAND flash cells, notably as the scale of their features reduces. To address this issue, implementing error correction codes (ECC) proves to be an effective solution. Among the various methods, BCH coding has gained significant interest because of its exceptional error correction capabilities. Over the last decades, there has been much research on BCH decoder design to meet the demand for reduced hardware complexities, minimized delay performance, and lower power dissipation to enable BCH decoders and their VLSI implementations to facilitate different code lengths and rates of code. This paper surveys the trends and challenges associated with BCH decoder in NAND flash memory devices, the possible solutions for overcoming of time and area overhead in architecture of BCH decoder block and an examination of the extent to which present architectures will respond to the escalating requirements on data transfer rate, bit error rate (BER) performance, power consumption, and silicon area that will be essential for the extensive acceptance of BCH code in applications that will emerge in the near future. To demonstrate the need for such solutions, we present rigorous experimental data on BCH error correction codes on various types of flash memory errors, to motivate the need for such techniques. Based on the understanding developed by the experimental characterization, we describe several area-delay efficient techniques, including three low-latency decoding strategies for implementing the BCH decoder: pipeline method, re-encoding scheme, and parallelization method, and various hardware optimization strategies for the BCH decoder, such as three area-efficient syndrome block architectures, four error locator polynomial detection algorithms, and four error position identification algorithms using the Chien search method. We investigate the increase in reliability that each of these methods brings. We also briefly address future directions that these methods and flash memory techniques could evolve into the future.
- Published
- 2024
- Full Text
- View/download PDF
49. Some binary BCH codes with length n = 2m + 1.
- Author
-
Liu, Yang, Li, Ruihu, Fu, Qiang, Lu, Liangdong, and Rao, Yi
- Subjects
- *
BCH codes , *BINARY codes , *CYCLOTOMIC fields , *CYCLIC codes , *FINITE fields - Abstract
Abstract Under research for nearly sixty years, Bose–Chaudhuri–Hocquenghem (BCH) codes have played increasingly important roles in many applications such as communication, data storage and information security. However, the dimension and minimum distance of BCH codes have been seldom solved by now because of their intractable characteristics. The objective of this paper is to study the dimensions of some binary BCH codes with length n = 2 m + 1. Many new techniques are employed to investigate the coset leaders modulo n. For m = 2 t + 1 , 4 t + 2 , 8 t + 4 and m ≥ 10 , the first five largest coset leaders modulo n are determined, and the dimensions of some BCH codes of length n with designed distance δ > 2 ⌈ m 2 ⌉ are presented. These new skills and results may be helpful to study other types of cyclic codes over finite fields. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
50. Steane enlargement of entanglement-assisted quantum error-correcting codes.
- Author
-
Galindo, Carlos, Hernando, Fernando, and Matsumoto, Ryutaroh
- Subjects
ERROR-correcting codes - Abstract
We introduce a Steane-like enlargement procedure for entanglement-assisted quantum error-correcting codes (EAQECCs) obtained by considering Euclidean inner product. We give formulae for the parameters of these enlarged codes and apply our results to explicitly compute the parameters of enlarged EAQECCs coming from some BCH codes. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.