Chong-Dao Lee

Orcid: 0000-0003-0305-084X

According to our database1, Chong-Dao Lee authored at least 43 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On Decoding Binary Quasi-Reversible BCH Codes.
IEEE Trans. Inf. Theory, 2022

Step-by-Step Decoding of Binary Quasi-Reversible BCH Codes.
IEEE Trans. Commun., 2022

2021
Algebraic Decoding of Quasi-Reversible BCH Codes Using Band Matrices.
IEEE Trans. Commun., 2021

Reduced-Complexity Quasi-Reversible BCH Decoders for Data Storage Systems.
Proceedings of the IEEE International Conference on Consumer Electronics-Taiwan, 2021

2020
On Decoding Algebraic Codes Using Radical Locators.
IEEE Trans. Inf. Theory, 2020

2019
Radical-Locator Polynomials and Row-Echelon Partial Syndrome Matrices With Applications to Decoding Cyclic Codes.
IEEE Trans. Inf. Theory, 2019

2018
The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance.
IEEE Trans. Inf. Theory, 2018

Algebraic Decoding of Cyclic Codes Using Partial Syndrome Matrices.
IEEE Trans. Inf. Theory, 2018

A construction of group divisible designs with block sizes 3 to 7.
Des. Codes Cryptogr., 2018

New Locator Polynomials for Cyclic Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Generation of Long Perfect Gaussian Integer Sequences.
IEEE Signal Process. Lett., 2017

Perfect Gaussian integer sequences from monomial o-polynomials.
Proceedings of the 18th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2017

Construction of perfect Gaussian integer sequences from Payne's o-polynomial.
Proceedings of the 2017 IEEE International Conference on Signal Processing, 2017

2016
A Systematic Method for Constructing Sparse Gaussian Integer Sequences With Ideal Periodic Autocorrelation Functions.
IEEE Trans. Commun., 2016

Algebraic Decoding of Cyclic Codes Without Error-Locator Polynomials.
IEEE Trans. Commun., 2016

Further results on degree-2 perfect Gaussian integer sequences.
IET Commun., 2016

Families of Gaussian integer sequences with high energy efficiency.
IET Commun., 2016

2015
Algebraic Decoding of Some Quadratic Residue Codes With Weak Locators.
IEEE Trans. Inf. Theory, 2015

Perfect Gaussian Integer Sequences of Arbitrary Composite Length.
IEEE Trans. Inf. Theory, 2015

Perfect Gaussian Integer Sequences of Odd Period ${2^m} - 1$.
IEEE Signal Process. Lett., 2015

2014
Improved decoding of binary Golay code.
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

2013
Unusual General Error Locator Polynomials for Single-Syndrome Decodable Cyclic Codes.
IEEE Commun. Lett., 2013

2012
New method of predetermining unified unknown syndrome representations for decoding binary cyclic codes.
IET Commun., 2012

Multivariate Interpolation Formula over Finite Fields and Its Applications in Coding Theory
CoRR, 2012

More on the unified unknown syndrome representations for a class of binary cyclic codes.
Proceedings of the International Symposium on Intelligent Signal Processing and Communications Systems, 2012

2011
Weak General Error Locator Polynomials for Triple-Error-Correcting Binary Golay Code.
IEEE Commun. Lett., 2011

2010
Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula.
IEEE Trans. Inf. Theory, 2010

Decoding Binary Cyclic Codes with Irreducible Generator Polynomials up to Actual Minimum Distance.
IEEE Commun. Lett., 2010

Unusual general error locator polynomial for the (23, 12, 7) golay code.
IEEE Commun. Lett., 2010

A Result on Zetterberg Codes.
IEEE Commun. Lett., 2010

More on general error locator polynomials for a class of binary cyclic codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
A New Scheme to Determine the Weight Distributions of Binary Extended Quadratic Residue Codes.
IEEE Trans. Commun., 2009

A unified method for determining the weight enumerators of binary extended quadratic residue codes.
IEEE Commun. Lett., 2009

2008
Algebraic Decoding of the (89, 45, 17) Quadratic Residue Code.
IEEE Trans. Inf. Theory, 2008

Zech Logarithmic Decoding of Triple-Error-Correcting Binary Cyclic Codes.
IEEE Commun. Lett., 2008

On determination of the weight distribution of binary (168, 84, 24) extended quadratic residue code.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Efficient Decoding of Systematic (41, 21, 9) Quadratic Residue Code.
Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, 2008

2007
Algebraic Decoding of Quadratic Residue Codes Using Berlekamp-Massey Algorithm.
J. Inf. Sci. Eng., 2007

A result on the weight distributions of binary quadratic residue codes.
Des. Codes Cryptogr., 2007

2005
The weight distributions of some binary quadratic residue codes.
IEEE Trans. Inf. Theory, 2005

Algebraic decoding of (103, 52, 19) and (113, 57, 15) quadratic residue codes.
IEEE Trans. Commun., 2005

2003
Algebraic decoding of (71, 36, 11), (79, 40, 15), and (97, 49, 15) quadratic residue codes.
IEEE Trans. Commun., 2003

Algebraic decoding of (79, 40, 15) quadratic residue code using inverse-free Berlekamp-Massey algorithm.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003


  Loading...