| Publication | Date of Publication | Type |
|---|
On Decoding Binary Quasi-Reversible BCH Codes
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu)
Journal of Discrete Mathematical Sciences and Cryptography | 2022-06-09 | Paper |
On Decoding Algebraic Codes Using Radical Locators
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
A family of group divisible designs with arbitrary block sizes
Taiwanese Journal of Mathematics | 2019-12-12 | Paper |
A family of group divisible designs with arbitrary block sizes
Taiwanese Journal of Mathematics | 2019-12-12 | Paper |
The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Some quantum MDS codes with large minimum distance from generalized Reed-Solomon codes
Cryptography and Communications | 2018-08-28 | Paper |
A construction of group divisible designs with block sizes 3 to 7
Designs, Codes and Cryptography | 2018-05-24 | Paper |
Algebraic Decoding of a Class of Binary Cyclic Codes Via Lagrange Interpolation Formula
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Algebraic Decoding of Some Quadratic Residue Codes With Weak Locators
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Degrees of irreducible polynomials over binary field | 2017-04-12 | Paper |
| A construction of group divisible designs with zero block sum | 2016-12-30 | Paper |
| scientific article; zbMATH DE number 6511196 (Why is no real title available?) | 2015-11-18 | Paper |
New method of predetermining unified unknown syndrome representations for decoding binary cyclic codes
IET Communications | 2013-10-18 | Paper |
A fast parallel \((23,12,7)\) QR decoder based on syndrome-weight determination
Computers and Electrical Engineering | 2011-05-19 | Paper |
Algebraic Decoding of the $(89, 45, 17)$ Quadratic Residue Code
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The Weight Distributions of Some Binary Quadratic Residue Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A result on the weight distributions of binary quadratic residue codes
Designs, Codes and Cryptography | 2007-09-20 | Paper |
| A note on the number of irreducible polynomials over finite fields | 2006-03-01 | Paper |
Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
Information Sciences | 2005-12-05 | Paper |
On the number of primitive polynomials over finite fields
Finite Fields and their Applications | 2005-09-29 | Paper |
Normal bases over \(\text{GF}(q)\)
Journal of Algebra | 2002-10-03 | Paper |
Imprimitive association schemes of low ranks and Higmanian graphs
Annals of Combinatorics | 2001-07-03 | Paper |
