Encoder and Adaptive Decoder for a (15,6,2) DEC-TED BCH Code

2020 ◽  
Author(s):  
Pallavi Rao ◽  
Pranjali Babshet ◽  
Ramya Arun Babu ◽  
M S Sunita
Keyword(s):  
Bch Code

ON TWO PROBLEMS OF ASYMMETRIC QUANTUM CODES

2014 ◽  
Vol 28 (06) ◽  
pp. 1450017 ◽  
Author(s):  
RUIHU LI ◽  
GEN XU ◽  
LUOBIN GUO
Keyword(s):  
Cyclic Codes ◽  
Error Correcting Codes ◽  
Bch Code ◽  
Quantum Codes ◽  
Quantum Code ◽  
Asymmetric Quantum ◽  
Asymmetric Quantum Codes ◽  
Special Cases ◽  
Quantum Error ◽  
Better Than

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δ max +1 from binary primitive cyclic codes of length n = 2m-1, where δ max = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.

Prototype of Telemetry, Tracking, and Command module for Tel-USat with BCH code

2019 ◽  
Author(s):  
Fachrul Reiza Medina ◽  
Heroe Wijanto ◽  
Edwar ◽  
Camila Putri Rahmadani ◽  
Bramandika Holy Bagas Pangestu
Keyword(s):  
Bch Code

scholarly journals A Lightweight BCH Code Corrector of TRNG with Measurable Dependence

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Hojoong Park ◽  
Yongjin Yeom ◽  
Ju-Sung Kang
Keyword(s):  
Linear Code ◽  
Random Number ◽  
Random Number Generator ◽  
The Other ◽  
Bch Code ◽  
Compression Rate ◽  
Number Generator ◽  
Von Neumann ◽  
Other Hand ◽  
Cryptographic Algorithms

We propose a new lightweight BCH code corrector of the random number generator such that the bitwise dependence of the output value is controllable. The proposed corrector is applicable to a lightweight environment and the degree of dependence among the output bits of the corrector is adjustable depending on the bias of the input bits. Hitherto, most correctors using a linear code are studied on the direction of reducing the bias among the output bits, where the biased input bits are independent. On the other hand, the output bits of a linear code corrector are inherently not independent even though the input bits are independent. However, there are no results dealing with the independence of the output bits. The well-known von Neumann corrector has an inefficient compression rate and the length of output bits is nondeterministic. Since the heavy cryptographic algorithms are used in the NIST’s conditioning component to reduce the bias of input bits, it is not appropriate in a lightweight environment. Thus we have concentrated on the linear code corrector and obtained the lightweight BCH code corrector with measurable dependence among the output bits as well as the bias. Moreover, we provide some simulations to examine our results.

Simplified fault-tolerant decoder for BCH code

1992 ◽  
Vol 73 (6) ◽  
pp. 1105-1111
Author(s):  
DER-LAN LO ◽  
PO-CHIANG LU ◽  
HSUEN-CHYUN SHYU
Keyword(s):  
Fault Tolerant ◽  
Bch Code
Sign in / Sign up

Export Citation Format

Share Document