Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.12065 · Designs Codes and Cryptography

Polycyclic codes associated with trinomials: good codes and open questions

Nuh Aydın, Peihan Liu, Bryan Yoshino

Published Apr 5, 2022• 12 citations
arXivHTMLPDF
DOI
10.1007/s10623-022-01038-y

Related papers

Quasi-polycyclic and skew quasi-polycyclic codes over Fq

Tushar Bag, Daniel Panario

Finite Fields and Their Applications•Nov 1, 2024•5 citations

On the algebraic structure of quasi-polycyclic codes and new quantum codes

Hassan Ou-azzou, Mustapha Najmeddine, Aydin Nuh

Quantum Information Processing•Mar 5, 2024•5 citations

Quantum synchronizable codes, polynomial and quasi-polynomial shifts

Edgar Martínez-Moro, Miguel de los Ríos de Antonio

Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.

arXiv:2611.10903•Nov 7, 2026•0 citations

Quantum codes construction from skew polycyclic codes

Shikha Patel, Om Prakash

This paper establishes the relation between skew polycyclic and skew sequential codes over a finite field. We prove with different induced vectors that right Θ-polycyclic codes are left Θ−1-polycyclic codes. Further, we characterize the condition under which a code is both left and right skew polycyclic with the same induced vectors. Moreover, an analogous study is also discussed for skew sequential codes. Further, to show the novelty of our work, many examples of "MDS (Maximum Distance Separable)" codes are provided. Finally, as an application, we construct quantum codes with good parameters from these codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•3 citations

Triorthogonal codes and self-dual codes

Minjia Shi, Haodong Lu, Jon-Lark Kim +1 more

arXiv:2408.09685•Quantum Information Processing•Jul 20, 2024•11 citations

Polycyclic Codes and Their Application in Constructing AEAQECCs

Juan Li, Yunbo Tian, Fanghui Ma

In this article, we study polycyclic codes over the ring R=Fq[v]/⟨v2−1⟩, where q=pm with p being an odd prime. First, we introduce polycyclic codes and sequential codes over R, and characterize the structural properties of these polycyclic codes. Next, we analyze the Euclidean dual codes, annihilator dual codes, annihilator self-orthogonal codes, and annihilator linear complementary dual (LCD) codes associated with this family of codes. Finally, some asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) are constructed from polycyclic codes over R. Moreover, the parameters of our AEAQECCs are new in the existing literature.

Axioms•Feb 2, 2026•0 citations
Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.
This paper establishes the relation between skew polycyclic and skew sequential codes over a finite field. We prove with different induced vectors that right Θ-polycyclic codes are left Θ−1-polycyclic codes. Further, we characterize the condition under which a code is both left and right skew polycyclic with the same induced vectors. Moreover, an analogous study is also discussed for skew sequential codes. Further, to show the novelty of our work, many examples of "MDS (Maximum Distance Separable)" codes are provided. Finally, as an application, we construct quantum codes with good parameters from these codes.
In this article, we study polycyclic codes over the ring R=Fq[v]/⟨v2−1⟩, where q=pm with p being an odd prime. First, we introduce polycyclic codes and sequential codes over R, and characterize the structural properties of these polycyclic codes. Next, we analyze the Euclidean dual codes, annihilator dual codes, annihilator self-orthogonal codes, and annihilator linear complementary dual (LCD) codes associated with this family of codes. Finally, some asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) are constructed from polycyclic codes over R. Moreover, the parameters of our AEAQECCs are new in the existing literature.