Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Özkaya, Buket"'
Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices of the in
Externí odkaz:
http://arxiv.org/abs/2405.15057
Spectral bounds form a powerful tool to estimate the minimum distances of quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to those of quasi-cyclic codes. Based on the eigenvalues of quasi-cyclic codes and the corresponding
Externí odkaz:
http://arxiv.org/abs/2311.08156
Autor:
GÜLMEZ TEMÜR, Burcu1, ÖZKAYA, Buket2 ozkayab@metu.edu.tr
Publikováno v:
Turkish Journal of Mathematics. 2024, Vol. 48 Issue 4, p778-792. 15p.
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some asymptotic result
Externí odkaz:
http://arxiv.org/abs/2007.16029
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with stricly improved
Externí odkaz:
http://arxiv.org/abs/1906.04964
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a manner similar
Externí odkaz:
http://arxiv.org/abs/1906.04967
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact enumeration
Externí odkaz:
http://arxiv.org/abs/1703.03115
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 yie
Externí odkaz:
http://arxiv.org/abs/1702.00153