Results 171 to 180 of about 521,304 (203)
Some of the next articles are maybe not open access.
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
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 +2 more sources
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 generalized Hamming weights of BCH codes
IEEE Transactions on Information Theory, 1994A method is introduced to determine the generalized Hamming weights [\textit{V. K. Wei}, IEEE Trans. Inf. Theory 37, No. 5, 1412--1418 (1991; Zbl 0735.94008)] of certain families of codes, by the use of a geometric description of their dual. This method is ruled out by the authors to calculate some generalized weights of BCH(2) and BCH(3).
van der Geer, G.B.M., van der Vlugt, M.
openaire +5 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
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 +3 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 +2 more sources