Vol. 13, No. 1, 2020

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
Submission guidelines
Submission form
Editorial board
Editors' interests
ISSN (electronic): 1944-4184
ISSN (print): 1944-4176
Author index
To appear
Other MSP journals
This article is available for purchase or by subscription. See below.
Some generalizations of the ASR search algorithm for quasitwisted codes

Nuh Aydin, Thomas H. Guidotti, Peihan Liu, Armiya S. Shaikh and Robert O. VandenBerg

Vol. 13 (2020), No. 1, 137–148

One of the most important and challenging problems in coding theory is explicit construction of linear codes with the best possible parameters. It is well known that the class of quasitwisted (QT) codes is asymptotically good and contains many linear codes with best known parameters (BKLCs). A search algorithm (ASR) on QT codes has been particularly effective to construct such codes. Recently, the ASR algorithm was generalized based on the notion of code equivalence. In this work, we introduce a new generalization of the ASR algorithm to include a broader scope of QT codes. As a result of implementing this algorithm, we have found eight new linear codes over the field 𝔽5. Furthermore, we have found seven additional new codes from the standard constructions of puncturing, shortening or Construction X. We also introduce a new search algorithm that can be viewed as a further generalization of ASR into the class multitwisted (MT) codes. Using this method, we have found many codes with best known parameters with more direct and desirable constructions than what is currently available in the database of BKLCs.

PDF Access Denied

We have not been able to recognize your IP address as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 30.00:

quasitwisted codes, multitwisted codes, best known linear codes, ASR search algorithm
Mathematical Subject Classification 2010
Primary: 94B15, 94B60
Received: 2 August 2019
Revised: 8 December 2019
Accepted: 27 December 2019
Published: 4 February 2020

Communicated by Kenneth S. Berenhaut
Nuh Aydin
Kenyon College
Gambier, OH
United States
Thomas H. Guidotti
Kenyon College
Gambier, OH
United States
Peihan Liu
Kenyon College
Gambier, OH
United States
Armiya S. Shaikh
Kenyon College
Gambier, OH
United States
Robert O. VandenBerg
Kenyon College
Gambier, OH
United States