Results 151 to 160 of about 1,776 (185)
Some of the next articles are maybe not open access.
A class of constacyclic BCH codes
Cryptography and Communications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhonghua Sun 0001, Shixin Zhu, Liqi Wang
openaire +1 more source
BCH Code Selection and Iterative Decoding for BCH and LDPC Concatenated Coding System
IEEE Communications Letters, 2013In this letter, we consider a concatenated BCH and QC-LDPC coding system for potential use of data protection on flash memory. Two issues are studied, and strategies to resolve them are proposed. First, in order to guarantee that the concatenated coding system is free from undesired error floor, we propose a strategy to select the outer BCH codes ...
Pin-Han Chen +3 more
openaire +1 more source
2009
The Code for the Construction and Equipment of Ships Carrying Dangerous Chemicals in Bulk (BCH Code) presents amendments to the Code to reflect the 2007 revision of MARPOL Annex II and other amendments related to: Survey and certification Materials of construction Fire protection
openaire +1 more source
The Code for the Construction and Equipment of Ships Carrying Dangerous Chemicals in Bulk (BCH Code) presents amendments to the Code to reflect the 2007 revision of MARPOL Annex II and other amendments related to: Survey and certification Materials of construction Fire protection
openaire +1 more source
On the duals of binary BCH codes
IEEE Transactions on Information Theory, 2001Summary: We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
openaire +1 more source
On the Distance Distributions of BCH Codes and Their Duals
Designs, Codes and Cryptography, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilia Krasikov, Simon Litsyn
openaire +2 more sources
Sum-product decoding of BCH codes
2008 5th International Symposium on Turbo Codes and Related Topics, 2008This paper proposes methods to improve soft-input and soft-output decoding performance of BCH codes by sum-product algorithm (SPA). A method to remove cycles of length four (RmFC) in the Tanner graph has been proposed. However, the RmFC can not realize good decoding performance for BCH codes which have more than one error correcting capability.
Haruo Ogiwara +2 more
openaire +1 more source
Journal of Combinatorial Designs, 1997
Summary: We develop the theory of a generalization of the notion of BCH-code to additive codes, which are not necessarily linear. The usefulness of this notion is demonstrated by constructing a large number of record-breaking linear codes via concatenation.
Edel, Yves, Bierbrauer, Jürgen
openaire +2 more sources
Summary: We develop the theory of a generalization of the notion of BCH-code to additive codes, which are not necessarily linear. The usefulness of this notion is demonstrated by constructing a large number of record-breaking linear codes via concatenation.
Edel, Yves, Bierbrauer, Jürgen
openaire +2 more sources
1992
Abstract The polynomial corresponding to a word w will be denoted by w(x), using the same letter, indeed we shall eventually identify words and polynomials. The set of all binary polynomials of degree less than n will be denoted by Pn (P for polynomial, but note that the maximum degree is n -1).
openaire +1 more source
Abstract The polynomial corresponding to a word w will be denoted by w(x), using the same letter, indeed we shall eventually identify words and polynomials. The set of all binary polynomials of degree less than n will be denoted by Pn (P for polynomial, but note that the maximum degree is n -1).
openaire +1 more source
On subgroup subcodes of BCH codes
J. Inf. Process. Cybern., 1991Summary: An approach to multiple errors correcting \(q\)-ary codes, viewed as subgroup subcodes of BCH codes, is presented. It has been shown that in the case of \(d\leqq q=p^ l\) for an infinite sequence of lengths the cardinality of obtained codes exceeds the cardinality of the corresponding BCH codes not less than \((q/p)^{d-2}\) times, i.e.
openaire +1 more source