The following pages link to Yaotsu Chang (Q172376):
Displaying 20 items.
- A fast parallel \((23,12,7)\) QR decoder based on syndrome-weight determination (Q537300) (← links)
- Some quantum MDS codes with large minimum distance from generalized Reed-Solomon codes (Q1667455) (← links)
- A construction of group divisible designs with block sizes 3 to 7 (Q1752545) (← links)
- A family of group divisible designs with arbitrary block sizes (Q2279385) (← links)
- A result on the weight distributions of binary quadratic residue codes (Q2383978) (← links)
- On the number of primitive polynomials over finite fields (Q2567160) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- New method of predetermining unified unknown syndrome representations for decoding binary cyclic codes (Q2853117) (← links)
- Algebraic Decoding of Some Quadratic Residue Codes With Weak Locators (Q2978724) (← links)
- (Q3374950) (← links)
- (Q3451924) (← links)
- The Weight Distributions of Some Binary Quadratic Residue Codes (Q3547721) (← links)
- Algebraic Decoding of the $(89, 45, 17)$ Quadratic Residue Code (Q3604973) (← links)
- The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance (Q4682939) (← links)
- Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula (Q4976036) (← links)
- On Decoding Binary Quasi-Reversible BCH Codes (Q5088441) (← links)
- On Decoding Algebraic Codes Using Radical Locators (Q5138860) (← links)
- Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu) (Q5865691) (← links)
- Imprimitive association schemes of low ranks and Higmanian graphs (Q5930081) (← links)
- Normal bases over \(\text{GF}(q)\) (Q5946410) (← links)
