Related papers: Decoding q-ary lattices in the Lee metric
We investigate the problem of strong spatial mixing of $q$-colorings on Bethe lattices. By analyzing the sum-product algorithm we establish the strong spatial mixing of $q$-colorings on $(b+1)$-regular Bethe lattices, for $q \geq 1+\lceil…
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…
We explore the possibility of introducing q-deformed connections on the quantum 2-sphere and 3-sphere, satisfying a twisted Leibniz rule in analogy with q-deformed derivations. We show that such connections always exist on projective…
Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical decoding algorithm remains a barrier to…
Topological subsystem codes can combine the advantages of both topological codes and subsystem codes. Suchara et al. proposed a framework based on hypergraphs for construction of such codes. They also studied the performance of some…
In this paper, we introduce a new channel model we term the q-ary multi-bit channel (QMBC). This channel models a memory device, where q-ary symbols (q=2^s) are stored in the form of current/voltage levels. The symbols are read in a…
A code over GF$(q^m)$ can be imaged or expanded into a code over GF$(q)$ using a basis for the extension field over the base field. The properties of such an image depend on the original code and the basis chosen for imaging. Problems…
The growing amount of data available in modern-day datasets makes the need to efficiently search and retrieve information. To make large-scale search feasible, Distance Estimation and Subset Indexing are the main approaches. Although binary…
A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most r) other symbols. A family of linear LRC codes that generalize the classic construction of…
In this letter, we propose a Voronoi shaping method with reduced encoding complexity. The method works for integer shaping and coding lattices satisfying the chain $\Lambda_s \subseteq \textbf{K}\mathbb{Z}^n \subseteq \Lambda_c$, with…
In the present paper we explicitly construct deformation quantizations of certain Poisson structures on E^*, where E -> M is a Lie algebroid. Although the considered Poisson structures in general are far from being regular or even…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
In this paper we consider surfaces with one or two families of spherical curvature lines. We show that every surface with a family of spherical curvature lines can locally be generated by a pair of initial data: a suitable curve of Lie…
We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We…
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been…
A global model of $q$-deformation for the quasi--orthogonal Lie algebras generating the groups of motions of the four--dimensional affine Cayley--Klein geometries is obtained starting from the three dimensional deformations. It is shown how…