LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Optimal GQPC Codes over the Finite Field Fq

This paper presents the algebraic structure of generalized quasi-polycyclic (GQPC) codes, which is a generalization of the right quasi-polycyclic (QPC) and generalized quasi-cyclic (GQC) codes over a finite field Fq.… Click to show full abstract

This paper presents the algebraic structure of generalized quasi-polycyclic (GQPC) codes, which is a generalization of the right quasi-polycyclic (QPC) and generalized quasi-cyclic (GQC) codes over a finite field Fq. Here, we mainly study the multi-generator polynomial of the right GQPC codes of index l. In this regard, we use the Chinese Remainder Theorem to decompose the right GQPC codes into their constituent codes. Further, we determine the dimension of a right GQPC code and provide a method for finding a normalized generating set for a multi-generator right GQPC code. As a by-product, we provide some examples of GQPC codes and obtain several optimal and near-optimal 2-generator right GQPC codes of index 2 over F2.

Keywords: codes finite; right gqpc; gqpc codes; finite field; gqpc

Journal Title: Mathematics
Year Published: 2025

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.