Results 161 to 170 of about 521,304 (203)
Two families of negacyclic BCH codes
Negacyclic BCH codes are a subclass of neagcyclic codes and are the best linear codes in many cases. However, there have been very few results on negacyclic BCH codes. Let q be an odd prime power and m be a positive integer.
Xiaoqiang Wang +2 more
exaly +2 more sources
On Quantum and Classical BCH Codes [PDF]
Classical BCH codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its dual code only if its designed distance d=O(sqrt(n)), and the converse is proved in the case of narrow-sense codes.
Pradeep Kiran Sarvepalli +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Parameters of Several Classes of BCH Codes
Because of their efficient encoding and decoding algorithms, cyclic codes - an interesting class of linear codes - are widely used in communication systems, storage devices, and consumer electronics.
Cunsheng Ding
exaly +2 more sources
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.
P Charpin
exaly +2 more sources
A Class of Narrow-Sense BCH Codes [PDF]
BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. made some new progress in BCH codes.
Shixin ZHU, Xiaoshan Kai, Zhonghua Sun
exaly +4 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 +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
A class of constacyclic BCH codes
Cryptography and Communications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shixin ZHU, Liqi Wang, Zhonghua Sun
exaly +3 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

