Searching for "BCH codes and Designs." – sorted by Relevance.
-
Studying the locator polynomials of minimum weight codewords of BCH codes.
- \Gamma 1. A BCH-code with designed distance ffi is denoted B(n; ffi ). A BCH-code is always a narrow
- Cited by 9 (2 self) – Add To MetaCart
-
The minimum distance of some binary codes via the Newton's identities.
- following facts : The dual of the BCH code of length 63 and designed distance 9 has true minimum distance 14
- Cited by 2 (1 self) – Add To MetaCart
-
DEC ECC Design to Improve Memory Reliability in Sub-100nm Technologies
- sizes that are usually a power of 2 [10]. In this work, we present a design of DEC BCH codes which
- Add To MetaCart
-
Derandomization
- 6; \Gamma n 2 \Delta ; 2 \Delta as the dual code of a BCH code with designed distance 7
- Add To MetaCart
-
Bounds on the minimum distance of the duals of BCH codes
- . Then, the narrow-sense BCH code of designed distance d is the code with defining-set T = [ 1s!d cl
- Add To MetaCart
-
Explicit Ramsey graphs and orthonormal labelings
- . This matrix is the parity check matrix of a binary BCH-code of designed distance 7 (see, e.g., [16], Chapter 9
- Cited by 36 (15 self) – Add To MetaCart
-
Tough Ramsey graphs without short cycles
- matrix of a binary BCH-code of designed distance 5 (see, e.g., [20], Chapter 9). The fact that Gk
- Cited by 14 (3 self) – Add To MetaCart
-
Enlargement of Calderbank Shor Steane quantum codes
- on classical Bose Chaudhuri Hocquenghem (BCH) codes are discussed. keywords Quantum error correction, BCH code
- Cited by 6 (0 self) – Add To MetaCart
-
Neither Reading Few Bits Twice nor Reading Illegaly Helps Much
- , and let C be a BCH-code with designed distance ffi = 2t + 1, where t p n=4. Then every (1; +s
- Cited by 22 (7 self) – Add To MetaCart
-
Efficient Decoding Methods in Goppa Codes based on Klein Curves
- (u) is called a BCH-code with designed distance t. From now on we restrict ourselves to the case l = 1 (narrow
- Add To MetaCart

