- 刘海洋
- 副研究员
- 北京市朝阳区北土城西路3号
简 历：
教育背景
1998.9-2002.7 清华大学
2004.9-2009.6 中国科学院微电子研究所
工作简历
2009.7-至今 中国科学院微电子研究所
社会任职： 研究方向：通信与信号处理算法及其VLSI实现 承担科研项目情况：
2013-2015 多进制LDPC码的线性规划译码方法研究 国家自然科学基金
代表论著：
[1] Liu H, Kim D, Li Y, et al. On the separating redundancy of extended Hamming codes. ISIT 2015, June 2015, 2406-2410.
[2] Liu H, Ma L. On the minimum distance of full-length RS-LDPC codes. IEEE Communications Letters, 2015, 19(11): 1869-1872.
[3] Liu H, Huang Q, Deng G, et al. Quasi-Cyclic representation and vector representation of RS-LDPC codes. IEEE Transactions on Communications, 2015, 63(4): 1033-1042.
[4] Liu H, Deng G, Chen J. On the minimum-weight codewords of array LDPC codes with column weight 4. IEICE Transactions on Fundamentals, 2014, E97-A(11): 2236-2246.
[5] Liu H, Yang S, Deng G, et al. More on the minimum distance of array LDPC codes. IEEE Communications Letters, 2014, 18(9): 1479-1482.
[6] Liu H, Li Y, Ma L, et al. On the smallest absorbing sets of LDPC codes from finite planes. IEEE Transactions on Information Theory, 2012, 58(6): 4014-4020.
[7] Liu H, He L, Chen J. Further results on the stopping distance of array LDPC matrices. IEICE Transactions on Fundamentals, 2012, E95-A(5): 918-926.
[8] Liu H, Qu W, Liu B, et al. On the decomposition method for linear programming decoding of LDPC codes. IEEE Transactions on Communications, 2010, 58(12): 3448-3458.
[9] Liu H, Ma L, Chen J. On the number of minimum stopping sets and minimum codewords of array LDPC codes. IEEE Communications Letters, 2010, 14(7): 670-672.
[10] Liu H, Lin X, Ma L, et al. On the stopping distance and stopping redundancy of finite geometry LDPC codes. IEICE Transactions on Fundamentals, 2008, E91-A(8): 2159-2166.
专利申请： 获奖及荣誉：
