Related papers: Analysis of cubic permutation polynomials for turb…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
A polynomial x^3+px^2+qx+r with the condition pr^(1/3)+ 3r^(2/3)+q=0 we call a Ramanujan cubic polynomial (RCP). We study different interest properties of RCP, in particular, an important role of a parameter pq/r. We prove some new…
Classical turbo codes efficiently approach the Shannon limit, and so bringing these over to the quantum scenario would allow for rapid transmission of quantum information. Early on in the work of defining the quantum analogue, it was shown…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous…
For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…
So far all the proven unconditionally secure prepare and measure protocols for the quantum key distribution(QKD) must solve the very complex problem of decoding the classical CSS code. In the decoding stage, Bob has to compare his string…
Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
Three block encoding methods are evaluated for solving linear systems of equations using QSVT (Quantum Singular Value Transformation). These are ARCSIN, FABLE and PREPARE-SELECT. The performance of the encoders is evaluated using a suite of…
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…
The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence. We show…
We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters…
Quasi parton distribution functions (QPDFs) are defined in terms of QCD fields at spacelike separations evaluated in matrix elements of hadrons moving with velocity $v$. These objects can be studied in lattice QCD. In the limit when $v$…
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…
Parameter recovering of channel codes is important in applications such as cognitive radio. The main task for that of a turbo code is to recover the interleaver. The existing optimal algorithm recovers interleaver parameters incrementally…
We study multivariate integration over the $s$-dimensional unit cube in a weighted space of infinitely differentiable functions. It is known from a recent result by Suzuki that there exists a good quasi-Monte Carlo (QMC) rule which achieves…
Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this…
Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all…
Let $f(X)=X(1+aX^{q(q-1)}+bX^{2(q-1)})\in\Bbb F_{q^2}[X]$, where $a,b\in\Bbb F_{q^2}^*$. In a series of recent papers by several authors, sufficient conditions on $a$ and $b$ were found for $f$ to be a permutation polynomial (PP) of $\Bbb…
Linear Maxwell equations for transverse magnetic (TM) polarized fields support single frequency surface plasmon polaritons (SPPs) localized at the interface of a metal and a dielectric. Metals are typically dispersive, i.e. the dielectric…