By Topic

On computer search for good quasi-cyclic 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

1 Author(s)
Zhi Chen ; Dept. of Electr. Eng., Linkoping Univ., Sweden

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. A lot of work has been done to find good QC codes with help of computers, and many good QC codes have been found. It should be noted that an exhaustive search is intractable with the increase in the code dimensions. In this paper, a local search method is used to find good binary QC codes

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994