title   
  

Structure and performance of generalized quasi-cyclic codes

Güneri, Cem and Özbudak, Ferruh and Özkaya, Buket and Saçıkara Karıksız, Elif and Sepasdar, Zahra and Sole, Patrick (2017) Structure and performance of generalized quasi-cyclic codes. (Accepted/In Press)

WarningThere is a more recent version of this item available.

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
421Kb

Abstract

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes. This decomposition leads to a trace formula, a minimum distance bound, and to a criteria for the GQC code to be self-dual or to be linear complementary dual (LCD). Explicit long GQC codes that are LCD, but not QC, are exhibited.

Item Type:Article
Subjects:Q Science > QA Mathematics > QA150-272.5 Algebra
ID Code:32486
Deposited By:Cem Güneri
Deposited On:26 Jul 2017 15:15
Last Modified:17 Aug 2017 15:50

Available Versions of this Item

Repository Staff Only: item control page