1. DSpace at
  2. Research Publications
  3. Year-2016
Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/2861
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBajpai, A.-
dc.contributor.authorKalsi, A.-
dc.contributor.authorWuttisittikulkij, L.-
dc.contributor.authorKovintavewat, P.-
dc.date.accessioned2021-10-03T11:00:03Z-
dc.date.available2021-10-03T11:00:03Z-
dc.date.issued2021-10-03-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2861-
dc.description.abstractThis article presents a simple, less computational complexity method for constructing exponent matrix ( ) 3, K having girth at least 8 of quasicyclic low-density parity-check (QC-LDPC) codes based on subtraction method. The construction of code deals with the generation of exponent matrix by three formulas. This method is flexible for any block-column length K . The simulations are shown in comparison with some existing appreciable work. The codes with girth 8 are constructed with circulant permutation matrix (CPM) size P max a ≥ {a a 2, 2, 2, rr k , , . 1.en_US
dc.language.isoen_USen_US
dc.subjectChannel Codingen_US
dc.subjectCirculant Permutation Matrix (CPM)en_US
dc.subjectGirthen_US
dc.subjectLow-Density Parity-Check (LDPC) Codesen_US
dc.subjectQuasiCyclic (QC) LDPC codesen_US
dc.titleA subtraction based method for the construction of quasi-cyclic LDPC codes of girth eighten_US
dc.typeArticleen_US
Appears in Collections:Year-2016

Files in This Item:
File Description SizeFormat 
Full Text.pdf284.44 kBAdobe PDFView/Open    Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.