Results 151 to 160 of about 18,445 (196)
Some of the next articles are maybe not open access.
Proceedings IEEE Southeastcon '95. Visualize the Future, 2002
BCH codes are powerful error-correcting codes. Algorithms used for decoding must be able to find the error locations, and for nonbinary codes, the error magnitudes. One of the most efficient algorithms for decoding BCH codes is Berlekamp's algorithm. To find the error locations the algorithm must solve a set of t equations in t unknowns.
L.L. Joiner, J.J. Komo
openaire +1 more source
BCH codes are powerful error-correcting codes. Algorithms used for decoding must be able to find the error locations, and for nonbinary codes, the error magnitudes. One of the most efficient algorithms for decoding BCH codes is Berlekamp's algorithm. To find the error locations the algorithm must solve a set of t equations in t unknowns.
L.L. Joiner, J.J. Komo
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 +3 more
openaire +2 more sources
Cryptography and Communications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Entanglement-Assisted Quantum Negacyclic BCH Codes
International Journal of Theoretical Physics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaojing +2 more
openaire +1 more source
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.
H. OGIWARA, K. SHIMAMURA, T. SHOHON
openaire +1 more source
Some Families of Quantum BCH Codes
International Journal of Theoretical Physics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Ming +3 more
openaire +2 more sources
IEEE Transactions on Information Theory, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuxing MATH +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuxing MATH +3 more
openaire +3 more sources
2008 International Conference on Computer Engineering & Systems, 2008
Recently, the theory of quantum error control codes has been extended to include quantum codes over asymmetric quantum channels - qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetric quantum channels.
openaire +1 more source
Recently, the theory of quantum error control codes has been extended to include quantum codes over asymmetric quantum channels - qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetric quantum channels.
openaire +1 more source
Quantum MDS codes from BCH constacyclic codes
Quantum Information Processing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liqin Hu, Qin Yue, Xianmang He
openaire +2 more sources
2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, 2011
The paper presents a new scheme of hybrid codes, which are constructed by the parallel concatenation of serially concatenated and Bose Ray-Chaudhuri Hacquenghem (BCH) codes. The constituents of the serially concatenated code are BCH and Recursive Systematic Convolutional (RSC) codes, which are linked by the pseudo-random interleaver.
openaire +1 more source
The paper presents a new scheme of hybrid codes, which are constructed by the parallel concatenation of serially concatenated and Bose Ray-Chaudhuri Hacquenghem (BCH) codes. The constituents of the serially concatenated code are BCH and Recursive Systematic Convolutional (RSC) codes, which are linked by the pseudo-random interleaver.
openaire +1 more source