Related papers: Quantum Gilbert-Varshamov Bound Through Symplectic…
The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…
In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in which the variables are required to satisfy digital restrictions in a given base. Certain sets of permitted digits, namely those giving rise to…
Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous…
In this paper, we examine algebraic geometric (AG) codes associated with curves generated by separated polynomials, and we create AG codes and quantum stabilizer codes from these curves by varying their parameters. Our research involves a…
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…
We explicitly compute limit shapes for several grand canonical Gibbs ensembles of partitions of integers. These ensembles appear in models of aggregation and are also related to invariant measures of zero range and coagulation-fragmentation…
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x_1,...,x_n) in {0,1}^n bit by bit via a channel limited to at most pn corruptions. The channel is online in the sense…
A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented. Relations of symplectic subspaces and quaternary additive codes concerning parameters of EAQECCs…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces -- composite permutation-invariant spaces of many qubits or qudits, composite constant-excitation Fock-state spaces of many…
In this paper, we study some codes of algebraic geometry related to certain maximal curves. Quantum stabilizer codes obtained through the self orthogonality of Hermitian codes of this error correcting do not always have good parameters.…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…
Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
A method is presented to compute approximate solutions for eigenequations in quantum mechanics with an arbitrary kinetic part. In some cases, the approximate eigenvalues can be analytically determined and they can be lower or upper bounds.…
For families of orthogonal and symplectic types quantum matrix (QM-) algebras, we derive corresponding versions of the Cayley-Hamilton theorem. For a wider family of Birman-Murakami-Wenzl type QM-algebras, we investigate a structure of its…
The Hamiltonian system of general relativity and its quantization without any matter or gauge fields are discussed on the basis of the symplectic geometrical theory. A symplectic geometry of classical general relativity is constructed using…