相关论文: Construction of q-ary Constant Weight Sequences us…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
To leverage the full potential of quantum error-correcting stabilizer codes it is crucial to have an efficient and accurate decoder. Accurate, maximum likelihood, decoders are computationally very expensive whereas decoders based on more…
Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and…
A Lagrangian continuum model for a string theory with central charge $c>1$ is formulated by incorporating Weyl and diffeomorphism gauge fixing. In particular the tachyon scattering amplitudes are deduced generalizing the standard $c\le 1$…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted…
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence…
Additive conjucyclic codes over $\F_{q^2}$ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general…
We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a…
A code $\mathcal{C}(n, k, d)$ defined over $\texttt{GF}(q^{n})$ is conventionally designed to encode a $k$-symbol user data into a codeword of length $n$, resulting in a fixed-rate coding. This paper proposes a coding procedure to derive a…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
Coding techniques may be useful for data center data survivability as well as for reducing traffic congestion. We present a queued cross-bar network (QCN) method that can be used for traffic analysis of both replication/uncoded and coded…
Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of methods to construct linear codes, one of which is based on…
Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. In this paper, we evaluate the performance of different test pattern sets using three methods. For test pattern sets with a certain structure…
We introduce a general method for building neural networks on quantum computers. The quantum neural network is a variational quantum circuit built in the continuous-variable (CV) architecture, which encodes quantum information in continuous…
We consider the task of communicating a generic bivariate function of two classical sources over a Classical-Quantum Multiple Access Channel (CQ-MAC). The two sources are observed at the encoders of the CQ-MAC, and the decoder aims at…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Inference for state-of-the-art deep neural networks is computationally expensive, making them difficult to deploy on constrained hardware environments. An efficient way to reduce this complexity is to quantize the weight parameters and/or…
This paper studies fixed rate vector quantisation for noisy networked control systems (NCSs) with correlated packet dropouts. In particular, a discrete-time linear time invariant system is to be controlled over an error-prone digital…
We consider decoding of vertically homogeneous interleaved sum-rank-metric codes with high interleaving order $s$, that are constructed by stacking $s$ codewords of a single constituent code. We propose a Metzner--Kapturowski-like decoding…