eprintid: 933
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/09/33
datestamp: 2023-11-09 15:49:05
lastmod: 2023-11-09 15:49:05
status_changed: 2023-11-09 15:38:44
type: conference_item
metadata_visibility: show
creators_name: Anggraeni, S.
creators_name: Jeoti, V.
title: (5. k) regular LDPC codes using novel code-construction
ispublished: pub
keywords: Low density parity check; Low encoding complexity; Non-singular parity part; Rank-deficiency of H; Regular LDPC, Encoding (symbols), Error correction
note: cited By 0; Conference of 2010 International Conference on Intelligent and Advanced Systems, ICIAS 2010 ; Conference Date: 15 June 2010 Through 17 June 2010; Conference Code:84196
abstract: This paper is a continuation of the work in IS wherein a novel code-construction method was proposed for constructing (3, k) regular LDPC codes. In this paper, the (3, k) construction technique is generalized to construct (5, k) regular code. The basic design of the proposed code-construction utilizes deterministic base matrices for information part and parity part in three stages of code-construction to achieve no rank-deficiency of H, no girth of 4-cycles, non-singular parity part (Hpar) and low encoding complexity. A typical performance of proposed (5, k) regular LDPC codes has been shown.
date: 2010
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-79952757110&doi=10.1109%2fICIAS.2010.5716198&partnerID=40&md5=c9affb0acfbf50b81d79816fbb2d75c9
id_number: 10.1109/ICIAS.2010.5716198
full_text_status: none
publication: 2010 International Conference on Intelligent and Advanced Systems, ICIAS 2010
place_of_pub: Kuala Lumpur
refereed: TRUE
isbn: 9781424466238
citation:   Anggraeni, S. and Jeoti, V.  (2010) (5. k) regular LDPC codes using novel code-construction.  In: UNSPECIFIED.