Translator Disclaimer
2020 Some generalizations of the ASR search algorithm for quasitwisted codes
Nuh Aydin, Thomas H. Guidotti, Peihan Liu, Armiya S. Shaikh, Robert O. VandenBerg
Involve 13(1): 137-148 (2020). DOI: 10.2140/involve.2020.13.137


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.


Download Citation

Nuh Aydin. Thomas H. Guidotti. Peihan Liu. Armiya S. Shaikh. Robert O. VandenBerg. "Some generalizations of the ASR search algorithm for quasitwisted codes." Involve 13 (1) 137 - 148, 2020.


Received: 2 August 2019; Revised: 8 December 2019; Accepted: 27 December 2019; Published: 2020
First available in Project Euclid: 20 March 2020

zbMATH: 07172117
MathSciNet: MR4059947
Digital Object Identifier: 10.2140/involve.2020.13.137

Primary: 94B15, 94B60

Rights: Copyright © 2020 Mathematical Sciences Publishers


This article is only available to subscribers.
It is not available for individual sale.

Vol.13 • No. 1 • 2020
Back to Top