Results 91 to 100 of about 521,304 (203)
Decoding algorithms for BCH codes [PDF]
, 1992 A powerful class of random error correcting codes are the Bose, Chaudhuri, and Hocquenghem (BCH) codes. These codes are cyclic in nature and are a generalization of Hamming codes.
Dubbs, Kenneth
core
Optimum implementation of BCH codes
, 1983 The Bose-Chaudhuri-Hocquenghem (BCH) codes are best constructive codes for channels in which error affect successive symbols independently. The binary BCH codes, a subclass of BCH codes, are known to have good random error correcting capability and Reed ...
Kumar, G. A.
core
A Low-Complexity and High-Throughput RTL Design of a BCH (15,7) Decoder
Journal of ICT Research and Applications, 2013 The Bose, Chaudhuri and Hocquenghem (BCH) codes form a large class of powerful random-error correcting cyclic codes. However, the implementation of its decoder requires high-complexity computation resources with a huge number of ...
Hendra Setiawan
doaj
PERFORMANCE COMPARISON OF NON-INTERLEAVED BCH CODES AND INTERLEAVED BCH CODES [PDF]
, 2008 This project covers the research about the BCH error correcting codes and the performance of interleaved and non-interleaved BCH codes. Both long and short BCH codes for multimedia communication are examined in an A WGN channel.
MOHD. NURI, NUR DIANA
core
Polynomial invariants of G-orbit errors of BCH codes and its application
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The article addresses the further development of methods of BCH codes norm decoding. The authors propose to use new syndrome invariants - polynomial invariants of automorphism group G of a family of BCH codes.
V. A. Lipnitski, E. V. Sereda
doaj
On BCH codes over arbitrary integer rings
, 1979 Bose-C-Hocquenghem (BCH) atdes with symbols from an arbitrary fhite integer ring are derived in terms of their generator polynomials. The derivation is based on the factohation of x to the power (n) - 1 over the unit ring of an appropriate extension of ...
Shankar, P
core
The dual codes of two families of BCH codes
Finite Fields and Their ApplicationsIn this paper, we present an infinite family of MDS codes over $\mathbb{F}_{2^s}$ and two infinite families of almost MDS codes over $\mathbb{F}_{p^s}$ for any prime $p$, by investigating the parameters of the dual codes of two families of BCH codes. Notably, these almost MDS codes include two infinite families of near MDS codes over $\mathbb{F}_{3^s}$,
Haojie Xu, Xia Wu, Wei Lu, Xiwang Cao
openaire +3 more sources
Quantum convolutional BCH codes
, 2020 -Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes.
Salah A Aly +4 more
core
IDENTIFICATION OF ERRORS WITH BCH CODES USING BASICS AND COMPLEMENTARY NORMS OF SYNDROMES
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The complexity of the norm decoding is exanimated. The results of computational experiments in the norm decoding for BCH codes are presented. Analysis of the results shows that part of the norm instead the whole norm of the syndrome can be used for the ...
V. K. Konopelko, D. N. Hoang
doaj
, 1999 After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model - the quantum erasure channel - is discussed.
Grassl, Markus, Beth, Thomas
openaire +2 more sources