English
Related papers

Related papers: Quantum Gilbert-Varshamov Bound Through Symplectic…

200 papers

In this work, we propose two criteria for linear codes obtained from the Plotkin sum construction being symplectic self-orthogonal (SO) and linear complementary dual (LCD). As specific constructions, several classes of symplectic SO codes…

Information Theory · Computer Science 2023-11-01 Shixin Zhu , Yang Li , Shitao Li

The problem of correcting transpositions (or swaps) of consecutive symbols in $ q $-ary strings is studied. Lower bounds on asymptotically achievable rates of codes correcting $ t = \tau n $ transpositions are derived. The first bound is…

Information Theory · Computer Science 2026-01-06 Mladen Kovačević , Keshav Goyal , Han Mao Kiah

Accuracy thresholds of quantum error correcting codes, which exploit topological properties of systems, defined on two different arrangements of qubits are predicted. We study the topological color codes on the hexagonal lattice and on the…

Disordered Systems and Neural Networks · Physics 2013-05-29 Masayuki Ohzeki

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…

Information Theory · Computer Science 2011-06-01 Alexey Frolov , Victor Zyablov

In this note, a class of error-correcting codes is associated to a toric variety associated to a fan defined over a finite field $\fff_q$, analogous to the class of Goppa codes associated to a curve. For such a ``toric code'' satisfying…

Algebraic Geometry · Mathematics 2007-07-16 David Joyner

We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with…

Information Theory · Computer Science 2018-06-26 Shu Liu , Chaoping Xing , Chen Yuan

The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…

Information Theory · Computer Science 2011-07-01 Ludo Tolhuizen

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized…

Information Theory · Computer Science 2015-08-06 Tao Zhang , Gennian Ge

In this paper we generalize the construction of binary self-orthogonal codes obtained from weakly self-orthogonal designs described by Tonchev in [12] in order to obtain self-orthogonal codes over an arbitrary field. We extend construction…

Combinatorics · Mathematics 2021-09-21 Vedrana Mikulić Crnković , Ivona Traunkar

We propose the quantum Lee weight for quantum errors, provide a Gilbert-Varshamov type bound, and a code construction for the proposed weight.

Quantum Physics · Physics 2021-05-27 Ryutaroh Matsumoto

The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…

Information Theory · Computer Science 2015-07-14 Abhay Kumar Singh , Narendra Kumar

We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum…

Quantum Physics · Physics 2008-01-28 Debbie Leung , Graeme Smith

We introduce - as a generalization of cyclic codes - the notion of transitive codes, and we show that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vladut-Zink bound over F_q, for all…

Algebraic Geometry · Mathematics 2007-05-23 Henning Stichtenoth

We investigate the quantum geometry of $2d$ surface $S$ bounding the Cauchy slices of 4d gravitational system. We investigate in detail and for the first time the symplectic current that naturally arises boundary term in the first order…

General Relativity and Quantum Cosmology · Physics 2015-07-10 Laurent Freidel , Alejandro Perez

The geometric quantization of a symplectic manifold endowed with a prequantum bundle and a metaplectic structure is defined by means of an integrable complex structure. We prove that its semi-classical limit does not depend on the choice of…

Symplectic Geometry · Mathematics 2009-11-11 L. Charles

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously considered by Galindo et al. in [4]. We give bounds on the…

Information Theory · Computer Science 2020-05-26 René Bødker Christensen , Olav Geil
‹ Prev 1 3 4 5 6 7 10 Next ›