title
  

Structure and performance of generalized quasi-cyclic codes

Warning The system is temporarily closed to updates for reporting purpose.

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. Finite Fields and Their Applications, 47 . pp. 183-202. ISSN 1071-5797 (Print) 1090-2465 (Online)

This is the latest version of this item.

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

Official URL: http://dx.doi.org/10.1016/j.ffa.2017.06.005

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
Uncontrolled Keywords:GQC codes; QC codes; LCD codes; Self-dual codes
Subjects:Q Science > QA Mathematics > QA150-272.5 Algebra
ID Code:32921
Deposited By:Cem Güneri
Deposited On:17 Aug 2017 15:50
Last Modified:17 Aug 2017 15:50

Available Versions of this Item

Repository Staff Only: item control page