By Topic

A genetic algorithm to search of good double-circulant codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Azouaoui, A. ; SIME Labo, MohammedV-Souisi Univ., Rabat, Morocco ; Askali, M. ; Belkasmi, M.

Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here an efficient algorithm for the search of good double-circulant codes. The algorithm presented is intended to generate a double-circulant code with maximum minimum distance for each length. Some results are presented and validated by exact method, others promising results are also presented for long double-circulant codes.

Published in:

Multimedia Computing and Systems (ICMCS), 2011 International Conference on

Date of Conference:

7-9 April 2011