Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

New good quasi-cyclic codes and codes with improved minimum distance

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read Online Read More Add to Saved list
  • Additional Information
    • Contributors:
      Kristianstad University, Faculty of Natural Science, Department of Computer Science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Avdelningen för datavetenskap, Originator; Kristianstad University, Faculty of Natural Science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Originator; Kristianstad University, Faculty of Natural Science, Research environment of Computer science, Högskolan Kristianstad, Fakulteten för naturvetenskap, Research environment of Computer science, Originator
    • Abstract:
      One of the most important and challenging problems in coding theory is to construct codes with optimal parameters. As a generalization of cyclic codes, quasi-cyclic (QC) codes as well as quasi-twisted (QT) codes have been shown to contain record-breaking codes. In this paper, various computer algorithms have been used to search for good QC codes. A lot of good new QC codes have been found and they have been used to construct new linear codes. A total 11 new codes that improve the bound on the minimum distance are presented.
    • File Description:
      electronic