Large-Girth Column-Weight Two QC-LDPC Codes
Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2013, Vol 5, Issue 5
Abstract
This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance comparable to that of random codes.
Authors and Affiliations
Gabofetswe Malema , Nkwebi Motlogelwa
Keywords
Related Articles
- EP ID EP131087
- DOI -
- Views 77
- Downloads 0
Effect of Principle Component Analysis and Support Vector Machine in Software Fault Prediction
Machine Learning (ML) approaches have a great impact in fault prediction. Demand for producing quality assured software in an organization has been rapidly increased during the last few years. This leads to increase in d...
Survey Paper for Maximization of Profit in Cloud Computing
The cloud is a next generation platform that provides dynamic resource pools, virtualization, and high availability. Today, it have the ability to utilize scalable, distributed computing environments within the confines...
Integrating Security and Usability at Requirement Specification Process
To construct any software, Requirement process is the common knowledge in most development organization. For any development of process security requirement is rarely supported. Over the years, researcher and developers...
Different Type of Feature Selection for Text Classification
Text categorization is the task of deciding whether a document belongs to a set of pre specified classes of documents. Automatic classification schemes can greatly facilitate the process of categorization. Categorization...
Improved Discretization Based Decision Tree for Continuous Attributes
The majority of the Machine Learning and Data Mining applications can easily be applicable only on discrete features. However, data in solid world are sometimes continuous by nature. Even for algorithms that will directl...