Results 141 to 150 of about 2,629 (187)
Some of the next articles are maybe not open access.
Eighteenth Convention of Electrical and Electronics Engineers in Israel, 1995
The authors give asymptotically better estimates for the error term in the binomial approximation of spectra of BCH codes than the ones derived by Sidelnikov, Kasami-Fujikawa-Lin and Solé.
Ilia Krasikov, Simon Litsyn
openaire +1 more source
The authors give asymptotically better estimates for the error term in the binomial approximation of spectra of BCH codes than the ones derived by Sidelnikov, Kasami-Fujikawa-Lin and Solé.
Ilia Krasikov, Simon Litsyn
openaire +1 more source
The Dual Codes of Several Classes of BCH Codes
IEEE Transactions on Information Theory, 2022As a special subclass of cyclic codes, BCH codes have wide applications in communication and storage systems. 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 same β.
Binkai Gong, Cunsheng Ding, Chengju Li
openaire +2 more sources
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 +1 more source
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 +1 more source
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 +1 more source
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 +2 more sources
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
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 a class of primitive BCH-codes
IEEE Transactions on Information Theory, 1990The author introduces a special class of primitive BCH codes, the minimal BCH (MB) codes. It is proved that an MB code has as minimum distance its designed distance. Using the Roos bound, the author proposes a lower bound, sometimes tight, for the minimum distance of the dual of an MB code.
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

