Results 81 to 90 of about 1,544,288 (201)

A Flexible BCH decoder for Flash Memory Systems using Cascaded BCH codes [PDF]

, 2019
NAND ash memories are widely used in consumer electronics, such as tablets, personal computers, smartphones, and gaming systems. However, unlike other standard storage devices, these ash memories suffer from various random errors.
Subbiah, Arul K.
core   +1 more source

Study and design of architecture for BCH code encoder and decoder

, 2010
Data corruption during the transmission and reception of data because of noisy channel medium is the most common problem faced in digital communication system. Thus, it is hard to get the reliable communication.
Anuradha A. Gautam
core   +1 more source

A BCH code and a sequence of cyclic codes

, 2014
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has
Shah, Tariq, Andrade, Antonio Aparecido de, Andrade, Antonio Aparecido de [UNESP], Khan, Mubashar   +3 more
core   +1 more source

The dual codes of two families of BCH codes

Finite Fields and Their Applications
In 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

Idempotent and BCH bound

, 2007
Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance reaches the BCH bound. Let ff be a primitive element of GF (2 m ). We denote R n = GF (2)[x]=(x
Daniel Augot, Nicolas Sendrier
core  

Quantum BCH Codes

, 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

ZEC ECC: A Zero-Byte Eliminating Compression-Based ECC Scheme for DRAM Reliability

IEEE Access
As DRAM cells continue to shrink, the conventional single error correction and double error detection (SECDED) code is not sufficient to provide DRAM error resilience.
Ji Hun Kwon, Hyeong Kon Bae, Young Seo Lee, Young-Ho Gong, Sung Woo Chung   +4 more
doaj   +1 more source

Energy-Efficiency of Dual-Switched Branch Diversity Receiver in Wireless Sensor Networks [PDF]

Iraqi Journal for Electrical and Electronic Engineering, 2011
In this paper, we develop an analytical energy efficiency model using dual switched branch diversity receiver in wireless sensor networks in fading environments.
Ghaida A. AL-Suhail
doaj  

Adaptive Error-Correction Coding for Joint Energy and Reliability Optimization in STT-MRAM

IEEE Access
This paper proposes a concatenated coding framework that combines Bose–Chaudhuri–Hocquenghem (BCH) coding with sparse coding to improve the reliability and energy efficiency of spin-transfer torque magnetic random access memory (STT-MRAM ...
Thanh-Loc Nguyen-Van, Tan Do-Duy, Chi Dinh Nguyen   +2 more
doaj   +1 more source

Noncyclic generalizations of BCH and srivastava codes

Information and Control, 1972
We define two classes of linear error correcting codes which are noncyclic generalizations of the well known BCH and Srivastava codes. The corresponding parity check matrices are basically alternating functions of certain elements of GF(qm) and all determinants of maximum order of the parity check matrices are alternants.
openaire   +1 more source