Results 161 to 170 of about 13,426 (200)
Some of the next articles are maybe not open access.
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
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
2018
The theory of error-correcting codes is a key pillar in modern digital communications. By introducing redundancy into codewords, error-correcting codes make messages robust against noises in communication channels. In 1948, Shannon proved that arbitrarily reliable communications are possible with the help of error-correcting codes.
openaire +2 more sources
The theory of error-correcting codes is a key pillar in modern digital communications. By introducing redundancy into codewords, error-correcting codes make messages robust against noises in communication channels. In 1948, Shannon proved that arbitrarily reliable communications are possible with the help of error-correcting codes.
openaire +2 more sources
1992
Abstract The polynomial corresponding to a word w will be denoted by w(x), using the same letter, indeed we shall eventually identify words and polynomials. The set of all binary polynomials of degree less than n will be denoted by Pn (P for polynomial, but note that the maximum degree is n -1).
openaire +1 more source
Abstract The polynomial corresponding to a word w will be denoted by w(x), using the same letter, indeed we shall eventually identify words and polynomials. The set of all binary polynomials of degree less than n will be denoted by Pn (P for polynomial, but note that the maximum degree is n -1).
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 +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
Some New Quantum Codes from Constacyclic BCH Codes
International Journal of Theoretical PhysicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ping +3 more
openaire +2 more sources