Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ffa.2017.06.005 | Finite Fields and Their Applications |
Keywords | DocType | Volume |
94B60,94B65,11T71 | Journal | 47 |
ISSN | Citations | PageRank |
1071-5797 | 4 | 0.44 |
References | Authors | |
7 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cem Güneri | 1 | 56 | 10.64 |
| Ferruh Özbudak | 2 | 179 | 40.10 |
| buket ozkaya | 3 | 37 | 5.15 |
| Elif Saçikara | 4 | 4 | 0.44 |
| Zahra Sepasdar | 5 | 4 | 0.44 |
| Patrick Solé | 6 | 45 | 12.57 |