Results 161 to 170 of about 1,544,288 (201)
Some of the next articles are maybe not open access.
On classical BCH codes and quantum BCH codes
Journal of Electronics (China), 2009It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal ...
Yajie Xu, Zhi Ma, Chunyuan Zhang
openaire +1 more source
IEEE Transactions on Information Theory, 1965
The Gorenstein-Zierler decoding algorithm for BCH codes is extended, modified, and analyzed; in particular, we show how to correct erasures as well as errors, exhibit improved procedures for finding error and erasure values, and consider in some detail the implementation of these procedures in a special-purpose computer.
openaire +2 more sources
The Gorenstein-Zierler decoding algorithm for BCH codes is extended, modified, and analyzed; in particular, we show how to correct erasures as well as errors, exhibit improved procedures for finding error and erasure values, and consider in some detail the implementation of these procedures in a special-purpose computer.
openaire +2 more sources
Shortened BCH codes (Corresp.)
IEEE Transactions on Information Theory, 1973By shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances superior to any known previously. We also give the weight spectra of three nonprimitive BCH codes whose minimum distances likewise constitute a significant improvement over those of the best codes previously known.
Hermann J. Helgert, Russell D. Stinaff
openaire +2 more sources
Some negacyclic BCH codes and quantum codes
Quantum Information Processing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junli Wang 0002 +3 more
openaire +3 more sources
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
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