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)

Warning
There is a more recent version of this item available.
[thumbnail of GQC_codes_revised.pdf] PDF
GQC_codes_revised.pdf
Restricted to Registered users only

Download (432kB) | Request a copy

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
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: Cem Güneri
Date Deposited: 26 Jul 2017 15:15
Last Modified: 17 Aug 2017 15:50
URI: https://research.sabanciuniv.edu/id/eprint/32486

Available Versions of this Item

Actions (login required)

View Item
View Item