Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes
Summary :
Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field Fq, we can construct a regular binary γq×q2 matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.2 pp.738-742
- Publication Date
- 2017/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.738
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Haiyang LIU
the Institute of Microelectronics of Chinese Academy of Sciences
Hao ZHANG
the Institute of Microelectronics of Chinese Academy of Sciences
Lianrong MA
Tsinghua University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Haiyang LIU, Hao ZHANG, Lianrong MA, "Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 2, pp. 738-742, February 2017, doi: 10.1587/transfun.E100.A.738.
Abstract: Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field Fq, we can construct a regular binary γq×q2 matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.738/_p
Copy
@ARTICLE{e100-a_2_738,
author={Haiyang LIU, Hao ZHANG, Lianrong MA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes},
year={2017},
volume={E100-A},
number={2},
pages={738-742},
abstract={Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field Fq, we can construct a regular binary γq×q2 matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.},
keywords={},
doi={10.1587/transfun.E100.A.738},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Further Results on the Minimum and Stopping Distances of Full-Length RS-LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 738
EP - 742
AU - Haiyang LIU
AU - Hao ZHANG
AU - Lianrong MA
PY - 2017
DO - 10.1587/transfun.E100.A.738
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2017
AB - Based on the codewords of the [q,2,q-1] extended Reed-Solomon (RS) code over the finite field Fq, we can construct a regular binary γq×q2 matrix H(γ,q), where q is a power of 2 and γ≤q. The matrix H(γ,q) defines a regular low-density parity-check (LDPC) code C(γ,q), called a full-length RS-LDPC code. Using some analytical methods, we completely determine the values of s(H(4,q)), s(H(5,q)), and d(C(5,q)) in this letter, where s(H(γ,q)) and d(C(γ,q)) are the stopping distance of H(γ,q) and the minimum distance of C(γ,q), respectively.
ER -
English
