Lianrong Ma

Tsinghua University — China

Computer Science · Physical Sciences

5h-index71citations34works0.32yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Error Correcting Code Techniques(19), Cooperative Communication and Network Coding(13), Advanced Wireless Communication Techniques(12), Coding theory and cryptography(11), graph theory and CDMA systems(5)

Publications34 total

A Class of Binary Linear Codes with Optimal Stopping Redundancy
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2025Open Access
On Minimal Pseudocodewords of Binary Hamming Codes
IEEE Transactions on Information Theory·2025
Binary Cycle Codes Have Optimal Stopping Redundancy
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2024· 1 citedOpen Access
An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2023· 1 citedOpen Access
On the First Separating Redundancy of Array LDPC Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2023Open Access
More on Incorrigible Sets of Binary Linear Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2022Open Access
On the Separating Redundancy of Ternary Golay Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2020· 1 cited
Some Results on Incorrigible Sets of Binary Linear Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2020· 1 cited
Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2020
On the Minimum Distance of Some Improper Array Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2019
Further Results on the Separating Redundancy of Binary Linear Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2019· 4 cited
On the problem σod(n) = σod(n+1)
Filomat·2019Open Access
On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2018· 3 cited
On the Second Separating Redundancy of LDPC Codes from Finite Planes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2018· 5 cited
On the Spark of Binary LDPC Measurement Matrices From Complete Protographs
IEEE Signal Processing Letters·2017· 10 cited
Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences·2017· 1 cited
Gaussian binomial coefficients modulo cyclotomic polynomials
Journal of Number Theory·2016· 1 cited
On the Minimum Distance of Full-Length RS-LDPC Codes
IEEE Communications Letters·2015· 3 cited
Odd solutions of $\sigma(n)-2n=2$ have at least six distinct prime factors
Publicationes Mathematicae Debrecen·2013· 1 citedOpen Access
On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
IEEE Transactions on Information Theory·2012· 10 cited
page 1 of 2Next →

Frequent Co-authors

Haiyang Liu(13), Yan Li(9), Haiyang LIU(4), Hao Zhang(3), Haiyang Liu(3), Xianke Zhang(3), Jie Chen(2), Daeyeoul Kim(2), Y Qi(2), C. J. Tang(2), Yan Li(2), Hao Zhang(1), Xinggang Lin(1), J. Chen(1), Jie Chen(1), Junhua Zhang(1), Xiaopeng Jiao(1), Hedong Hou(1), Yan Li(1), Yan Li(1)