A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8
Publish place: Journal of Algebraic Systems، Vol: 7، Issue: 2
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 352
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JAS-7-2_013
تاریخ نمایه سازی: 18 آذر 1398
Abstract:
In this paper, we define a structure to obtain exponent matrices of girth-8 QC-LDPC codes with column weight 3. Using the difference matrices introduced by Amirzade et al., we investigate necessary and sufficient conditions which result in a Tanner graph with girth 8. Our proposed method contributes to reduce the search space in recognizing the elements of an exponent matrix. In fact, in this method we only search to obtain one row of an exponent matrix. The other rows are multiplications of that row.
Keywords:
Authors
F. Amirzade
Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran.
M. Alishahi
Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran.
M.R. Rafsanjani-Sadeghi
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran.