Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 9
Abstract
In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an integer). This method searches circulant matrices in order to find the good quasi-cyclic code (QCC) having the largest minimum distance. A modified simulated annealing algorithm is used as an evaluator tool of the minimum distance of the obtained QCC codes. Based on this method we found 16 good quasi-cyclic codes with rates (1/2, 2/3 and 3/4), their estimated minimum distance reaches the lower bounds of codes considered to be the better linear block codes in Brouwer’s database.
Authors and Affiliations
Bouchaib AYLAJ, Said NOUH, Mostafa BELKASMI, Hamid ZOUAKI
Conceptual Modeling in Simulation: A Representation that Assimilates Events
Simulation is often based on some type of model of the evolved portion of the world being studied. The underlying model is a static description; the simulation itself is executed by generating events or dynamic aspects i...
Solving Dynamic Programming Problem by Pipeline Implementation on GPU
In this paper, we show the effectiveness of a pipeline implementation of Dynamic Programming (DP) on GPU. As an example, we explain how to solve a matrix-chain multiplication (MCM) problem by DP on GPU. This problem can...
Building Low Cost Cloud Computing Systems
The actual models of cloud computing are based in megalomaniac hardware solutions, being its implementation and maintenance unaffordable to the majority of service providers. The use of jail services is an alternative to...
Anomaly Detection with Machine Learning and Graph Databases in Fraud Management
In this paper, the task of fraud detection using the methods of data analysis and machine learning based on social and transaction graphs is considered. The algorithms for feature calculation, outlier detection and ident...
Optimized Routing Information Exchange in Hybrid IPv4-IPv6 Network using OSPFV3 & EIGRPv6
IPv6 is the next generation internet protocol which is gradually replacing the IPv4. IPv6 offers larger address space, simpler header format, efficient routing, better QoS and built-in security mechanisms. The migration...