Algebraic space–time coding allows for reliable data exchange across fading multiple-input multiple-output channels. A powerful technique for decoding space–time codes is Maximum-Likelihood (ML) decoding, but well-performing and widely-used codes such as the Golden code often suffer from high ML-decoding complexity. In this article, a recursive algorithm for decoding general algebraic space–tim...

core of quantum decoding network and is also the key step of recovery. The definitions of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix were presented, and then the error syndromes of quantum errors were expressed in terms of the columns of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix. It also showed that the error syndrome matrices o...

A new time integration strategy for the solution of convection-dominated partial differential equations in two space dimensions by the method of lines is presented. The strategy aims to ensure that the time integration error is less than the spatial discretisation error. This is achieved by making use of the individual contributions of the local spatial discretisation error and the local time i...

We present a general method for computing the asymptotic input-output weight distribution of convolutional encoders. In some instances, one can derive explicit analytic expressions. In general though, to determine the growth rate of the input-output weight distribution for a particular normalized input weight κ and output weight ω, a system of polynomial equations has to be solved. This method ...

We consider discretizations of a model elliptic problem by means of different numerical methods applied separately in different subdomains of the computational domain and coupled using the mortar technique. The subdomain grids need not match along the interfaces. We are also interested in the multiscale setting, where the subdomains are partitioned by a mesh of size h, whereas the interfaces ar...

AbstructGeneral symmetric channels are introduced, and near-maximum-likelihood decoding in these channels is studied. First, we define a class of suboptimal decoding algorithms .based on an incomplete search through the code trellis. It is proved that the decoding error probability of suboptimal decoding is bounded above for any q-ary code of length TL and code rate T by twice the error probabi...

Punctured Reed-Solomon (RS) and Gabidulin (G) codes over the field Fqm with locators from the subfield Fq can be represented as interleaving of m correspondent codes over the subfield Fq or can be considered as virtual interleaving of m correspondent codes over the field Fqm . Using a probabilistic unique syndrome decoder, m-interleaved or virtually interleaved codes can be decoded up to the sa...

We suggest new decoding techniques for diversity channels employing space time codes (STC) when the channel coefficients are unknown to both transmitter and receiver. Most of the existing decoders for unknown diversity channels employ training sequence in order to estimate the channel. These decoders use the estimates of the channel coefficients in order to perform maximum likelihood (ML) decod...

For the purpose of better application, the nonlinear correction of the transducer is very important. The soft computing methods which include the neural network linearization correction method and linear interpolation method are put forward to realize the nonlinear correction for the transducer. The principles, algorithms and realization of these methods are discussed, and nonlinear correction ...

Recently, the authors introduced an algebraic design framework for space–time coding in flat-fading channels [1]–[4]. In this correspondence, we extend this framework to design algebraic codes for multiple-input multiple-output (MIMO) frequency-selective fading channels. The proposed codes strive to optimally exploit both the spatial and frequency diversity available in the channel. We consider...