Ying Yu Tai

According to our database1, Ying Yu Tai authored at least 19 papers between 2004 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing.
IEEE Trans. Inf. Theory, 2013

Trapping set structure of LDPC codes on finite geometries.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Correcting combinations of errors and erasures with Euclidean geometry LDPC codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Trapping set structure of finite geometry LDPC codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2009
High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries.
IEEE Trans. Commun., 2009

2008
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach.
IEEE Trans. Commun., 2008

Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach.
IEEE Trans. Commun., 2008

New constructions of quasi-cyclic LDPC codes based on special classes of BIDBs for the AWGN and binary erasure channels.
IEEE Trans. Commun., 2008

2007
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach.
IEEE Trans. Inf. Theory, 2007

New Constructions of Quasi-Cyclic LDPC Codes Based on Special Classes of BIBDs for the AWGN and Binary Erasure Channels.
IEEE Trans. Commun., 2007

2006
Algebraic Construction of Quasi-Cyclic LDPC Codes for the AWGN and Erasure Channels.
IEEE Trans. Commun., 2006

Construction of High Performance and Efficiently Encodable Nonbinary Quasi-Cyclic LDPC Codes.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Algebraic Construction of Quasi-cyclic LDPC Codes - Part II: For AWGN and Binary Random and Burst Erasure Channels.
Proceedings of the Applied Algebra, 2006

Algebraic Constructions of Quasi-cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels.
Proceedings of the Applied Algebra, 2006

New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels.
Proceedings of the Applied Algebra, 2006

2005
Construction of LDPC codes for AWGN and binary erasure channels based on finite fields.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

2004
A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes.
IEEE Commun. Lett., 2004


  Loading...