Results 101 to 110 of about 1,348 (148)

BCH cyclic codes

Discrete Mathematics
BCH codes are a subclass of cyclic codes with many interesting properties. Over the last sixty years, a lot of progress has been made in the study of BCH codes. This survey paper presents the state-of-the-art of BCH cyclic codes and their applications.
Ding Cunsheng, Chengju Li
exaly   +4 more sources

Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes

IEEE Transactions on Information Theory, 1969
It is shown that if m \neq 8, 12 and m > 6 , there are some binary primitive BCH codes (BCH codes in a narrow sense) of length 2^{m} - 1 whose minimum weight is greater than the BCH bound. This gives a negative answer to the question posed by Peterson [1] of whether or not the BCH bound is always the actual minimum weight of a binary primitive BCH code.
T Kasami
exaly   +2 more sources

On a class of primitive BCH-codes

IEEE Transactions on Information Theory, 1990
The 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.
exaly   +2 more sources

On classical BCH codes and quantum BCH codes

Journal of Electronics (China), 2009
It 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

On spectra of BCH codes

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

On decoding BCH codes

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

On BCH-algebras

Mathematics Seminar Notes, 1983
The authors introduce the notion of BCH-algebras as a class of algebras satisfying certain properties of BCI-algebras.
Hu, Qing Ping, Li, Xin
openaire   +2 more sources

Soft BCH-ideals and Idealistic Soft BCH-algebras

2010 International Conference on Artificial Intelligence and Computational Intelligence, 2010
Applying soft sets to BCH-algebras, the concepts of soft BCH-ideals and idealistic soft BCH-algebras are introduced, and several examples are given. The intersection, union and “AND” operations of soft BCH-ideals and idealistic soft BCH-algebras are established.
openaire   +1 more source

Shortened BCH codes (Corresp.)

IEEE Transactions on Information Theory, 1973
By 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

BCH Code

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