eprintid: 337
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/03/37
datestamp: 2023-11-09 15:15:58
lastmod: 2023-11-09 15:15:58
status_changed: 2023-11-09 15:14:20
type: conference_item
metadata_visibility: show
creators_name: Anggraeni, S.
creators_name: Jeoti, V.
title: Efficient code construction of (3, k) regular LDPC codes
ispublished: pub
keywords: Encoding (symbols); Information technology, Code constructions; Code rates; Encoding complexities; H matrixes; LDPC codes; Parity check matrixes; Preprocessing steps; Random parts; Research communities, Codes (symbols)
note: cited By 0; Conference of International Symposium on Information Technology 2008, ITSim ; Conference Date: 26 August 2008 Through 29 August 2008; Conference Code:74115
abstract: The efficient code construction of regular LDPC codes that can effectively reduce the encoding complexity is still attracting a lot of attention from the research community. This paper presents a code construction method for (3, k) regular LDPC code that utilizes combination of a deterministic part and a partially random part in parity check matrix design. The parity check matrix (H), consisting of parity part (Hp) and information part (H i), is so designed as to have a girth of, at least, 6 and to generate various code rates by maintaining the number of rows in H matrix while only changing the number of columns in the information part (Hi). Our code construction is able to reduce encoding complexity by avoiding any preprocessing step during encoding. © 2008 IEEE.
date: 2008
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-57349101774&doi=10.1109%2fITSIM.2008.4632040&partnerID=40&md5=f9a1a2eeaeea901753122f4dd3589d72
id_number: 10.1109/ITSIM.2008.4632040
full_text_status: none
publication: Proceedings - International Symposium on Information Technology 2008, ITSim
volume: 4
place_of_pub: Kuala Lumpur
refereed: TRUE
isbn: 9781424423286
citation:   Anggraeni, S. and Jeoti, V.  (2008) Efficient code construction of (3, k) regular LDPC codes.  In: UNSPECIFIED.