default search action
Lianrong Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Haiyang Liu, Lianrong Ma:
On the First Separating Redundancy of Array LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(4): 670-674 (2024) - [j15]Haiyang Liu, Xiaopeng Jiao, Lianrong Ma:
An Investigation on LP Decoding of Short Binary Linear Codes With the Subgradient Method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(8): 1395-1399 (2024) - 2023
- [j14]Lingjun Kong, Haiyang Liu, Lianrong Ma:
More on Incorrigible Sets of Binary Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(5): 863-867 (2023) - 2021
- [j13]Hedong Hou, Haiyang Liu, Lianrong Ma:
Some Results on Incorrigible Sets of Binary Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(2): 582-586 (2021) - [j12]Haiyang Liu, Lianrong Ma, Hao Zhang:
On the Separating Redundancy of Ternary Golay Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(3): 650-655 (2021) - 2020
- [j11]Haiyang Liu, Hao Zhang, Lianrong Ma, Lingjun Kong
:
Structural Analysis of Nonbinary Cyclic and Quasi-Cyclic LDPC Codes with α-Multiplied Parity-Check Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(11): 1299-1303 (2020)
2010 – 2019
- 2019
- [j10]Haiyang Liu, Yan Li, Lianrong Ma:
On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1): 310-315 (2019) - [j9]Haiyang Liu, Lianrong Ma:
Further Results on the Separating Redundancy of Binary Linear Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(10): 1420-1425 (2019) - [j8]Haiyang Liu, Lianrong Ma, Hao Zhang:
On the Minimum Distance of Some Improper Array Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 2021-2026 (2019) - 2018
- [j7]Haiyang Liu, Yan Li
On the Second Separating Redundancy of LDPC Codes from Finite Planes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(3): 617-622 (2018) - 2017
- [j6]Haiyang Liu, Hao Zhang, Lianrong Ma:
Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(2): 738-742 (2017) - [j5]Haiyang Liu, Hao Zhang, Lianrong Ma:
On the Spark of Binary LDPC Measurement Matrices From Complete Protographs. IEEE Signal Process. Lett. 24(11): 1616-1620 (2017) - 2015
- [j4]Haiyang Liu, Lianrong Ma:
On the Minimum Distance of Full-Length RS-LDPC Codes. IEEE Commun. Lett. 19(11): 1869-1872 (2015) - 2012
- [j3]Haiyang Liu, Yan Li
On the Smallest Absorbing Sets of LDPC Codes From Finite Planes. IEEE Trans. Inf. Theory 58(6): 4014-4020 (2012) - 2010
- [j2]Haiyang Liu, Lianrong Ma, Jie Chen:
On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes. IEEE Commun. Lett. 14(7): 670-672 (2010)
2000 – 2009
- 2008
- [j1]Haiyang Liu, Xiao-yan Lin, Lianrong Ma, Jie Chen:
On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(8): 2159-2166 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: