Concatenated structure and a minimum distance bound for generalized quasi-cyclic codes

Date

2017-06-10

Author

Güneri, Cem
Özbudak, Ferruh
Özkaya, Buket
Saçıkara, Elif
Sepasdar, Zahra
Sole, Partick

Metadata

Show full item record

Item Usage Stats

106
views

0
downloads

Generalized quasi-cyclic (GQC) codes are mixed alphabet codes over a family of ring alphabets. Namely, if Rj := Fq[x]/hx mj − 1i for each j = 0, . . . , ` − 1 and positive integers m0, . . . , m`−1, an Fq[x]-submodule of R0 := R0 × · · · × R`−1 is called a GQC code. Compared to the special case of quasi-cyclic (QC) codes, allowing integers mj to be different gives freedom on the length of the code. We present a concatenated structure for GQC codes, which is more complicated to express than the QC case. Compatibility of the concatenated decomposition and the Chinese Remainder Theorem decomposition is also shown, which extends the analogous result of Güneri-Özbudak for QC codes. Concatenated structure also leads to a general minimum distance bound, extending the analogous bound for QC codes due to Jensen.

URI

https://hdl.handle.net/11511/87664
http://www.dma.unina.it/Fq13/Files/Booklet/Abstracts-Fq13.pdf

Conference Name

The 13 th International Conference on Finite Fields and their Applications, June 4–10, 2017

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

On Linear Complementary Pairs of Codes CARLET, Claude; Guneri, Cem; Özbudak, Ferruh; Ozkaya, Buket; SOLE, Patrick (Institute of Electrical and Electronics Engineers (IEEE), 2018-10-01) We study linear complementary pairs (LCP) of codes (C, D), where both codes belong to the same algebraic code family. We especially investigate constacyclic and quasicyclic LCP of codes. We obtain characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes. Our result for the constacyclic complementary pairs extends the characterization of linear complementary dual (LCD) cyclic codes given by Yang and Massey. We observe that when C and I) are complementary and constacyclic, the codes C and...
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes Lopez-Permouth, Sergio R.; Ozadam, Hakan; Özbudak, Ferruh; SZABO, Steve (2013-01-01) Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p(a), m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding such sets in the case that a = 2 is given. This explicitly gives the Hamming distance of all cyclic codes of le...
On affine variety codes from the Klein quartic Geil, Olav; Özbudak, Ferruh (Springer Science and Business Media LLC, 2019-03-01) We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433-464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and HOholdt, IEEE Trans. Inform. The...
Construction of quasi-cyclic self-dual codes Çomak, Pınar; Özbudak, Ferruh; Kim, Jon-Lark; Department of Cryptography (2013) Quasi-cyclic and self-dual codes are interesting classes of linear codes. Quasi-cyclic codes are linear codes which takes maximum possible value of minimum distance among the codes with the same length and same dimension. Another class of interesting linear codes is the self-dual codes. Self-dual codes have close connections with group theory, lattice theory and design theory. There has been an active research on the classi fication of self-dual codes over fi nite fi elds and over rings. We study on constru...
A minimum distance bound for quasi-nD-cyclic codes Özbudak, Ferruh (Elsevier BV, 2016-09-01) We provide a new concatenated structure for multidimensional quasi-cyclic (QnDC) codes over F-q and we give a trace representation for their codewords, which extends the known representations of QC and nD cyclic codes. Based on these results, we obtain a minimum distance bound for QnDC dyclic codes. Since QnDC codes are naturally related to nD convolutional codes, this bound also applies to a special class of 1-generator 2D convolutional codes.

Citation Formats

C. Güneri, F. Özbudak, B. Özkaya, E. Saçıkara, Z. Sepasdar, and P. Sole, “Concatenated structure and a minimum distance bound for generalized quasi-cyclic codes,” presented at the The 13 th International Conference on Finite Fields and their Applications, June 4–10, 2017, Gaeta, Italy, 2017, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/87664.