%T Efficient code construction of (3, k) regular LDPC codes
%V 4
%A S. Anggraeni
%A V. Jeoti
%C Kuala Lumpur
%K 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)
%X 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.
%O cited By 0; Conference of International Symposium on Information Technology 2008, ITSim ; Conference Date: 26 August 2008 Through 29 August 2008; Conference Code:74115
%L scholars337
%J Proceedings - International Symposium on Information Technology 2008, ITSim
%D 2008
%R 10.1109/ITSIM.2008.4632040