相关论文: Decoding q-ary lattices in the Lee metric
We review the application of lattice QCD to the phenomenology of b- and c-quarks. After a short discussion of the lattice techniques used to evaluate hadronic matrix elements and the corresponding systematic uncertainties, we summarise…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code design in various wireless communication setups. However,…
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…
The Lee-Friedrichs model has been very useful in the study of decay-scattering systems in the framework of complex quantum mechanics. Since it is exactly soluble, the analytic structure of the amplitudes can be explicitly studied. It is…
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…
In this paper, we develop a new channel model, which we name the $q$-ary partial erasure channel (QPEC). The QPEC has a $q$-ary input, and its output is either the input symbol or a set of $M$ ($2 \le M \le q$) symbols, containing the input…
We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is…
We present new efficient recursive decoders for the Barnes-Wall lattices based on their squaring construction. The analysis of the new decoders reveals a quasi-quadratic complexity in the lattice dimension and a quasi-linear complexity in…
We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…
Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…
All coboundary Lie bialgebras and their corresponding Poisson--Lie structures are constructed for the oscillator algebra generated by $\{\aa,\ap,\am,\bb\}$. Quantum oscillator algebras are derived from these bialgebras by using the…
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…
The discrete heat equation is worked out in order to illustrate the search of symmetries of difference equations. It is paid an special attention to the Lie structure of these symmetries, as well as to their dependence on the derivative…
It was shown in \cite{GXY18} that the length $n$ of a $q$-ary linear locally recoverable code with distance $d\ge 5$ is upper bounded by $O(dq^3)$. Thus, it is a challenging problem to construct $q$-ary locally recoverable codes with…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We give a realization of the quantum affine Lie superalgebras U_q(A(M,N))^(1) in terms of anyons defined on a one or two-dimensional lattice, the deformation parameter q being related to the statistical parameter $\nu$ of the anyons by q =…