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
Keywords
Related Articles
- EP ID EP101842
- DOI 10.14569/IJACSA.2016.070909
- Views 67
- Downloads 0
ZigBee Radio Frequency (RF) Performance on Raspberry Pi 3 for Internet of Things (IoT) based Blood Pressure Sensors Monitoring
Wireless Sensor Network has grown rapidly, e.g. using the Zigbee RF module and combined with the Raspberry Pi 3, a reason at this research is building a Wireless Sensor Network (WSN). this research discusses how sensor n...
Security Concerns in E-payment and the Law in Jordan
Recently communications and information technology became widely used in various aspects of life. The internet becomes the main network for information support. Using of internet enabled public and private organizations...
Effective Framework of Pedagogy
Learning paths drive learners to proficiency by using a selected sequence of training activities under time constraints. Therefore, learners can regulate learning and give feedback for pedagogy improvements. Studying lea...
Soft Error Tolerance in Memory Applications
This paper proposes a new method to detect and correct multi bit errors in memory applications using a combination of a clustering approach, Bit-Per-Byte error detection technique, and Majority Logic Decodable (MLD) code...
Complexity of Network Design for Private Communication and the P-vs-NP Question
We investigate infeasibility issues arising along network design for information-theoretically secure cryptography. In particular, we consider the problem of communication in perfect privacy and formally relate it to gra...