Výsledky vyhledávání - "Harrington, Matthew J."

Report

A Generalization of the ASR Search Algorithm to 2-Generator Quasi-Twisted Codes

Autor: Akre, Dev, Aydin, Nuh, Harrington, Matthew J., Pandey, Saurav R.

One of the main goals of coding theory is to construct codes with best possible parameters and properties. A special class of codes called quasi-twisted (QT) codes is well-known to produce codes with good parameters. Most of the work on QT codes has

Externí odkaz: http://arxiv.org/abs/2108.10316

Zobrazit plný text záznamu

Report

A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

Autor: Akre, Dev, Aydin, Nuh, Harrington, Matthew J., Pandey, Saurav

Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we found many c

Externí odkaz: http://arxiv.org/abs/2108.08619

Zobrazit plný text záznamu

Report

New Binary and Ternary Quasi-Cyclic Codes with Good Properties

Autor: Akre, Dev, Aydin, Nuh, Harrington, Matthew J., Pandey, Saurav R.

One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes over the b

Externí odkaz: http://arxiv.org/abs/2108.06752

Zobrazit plný text záznamu