GENERALIZED SPACE-TIME BLOCK CODES A. Lee Swindlehurst Dept. of Elec. & Comp. Engineering, Brigham Young University, Provo, UT, USA, 84602 e-mail: [email protected] ABSTRACT An iterative algorithm for ML detection of a certain class of space-time codes is presented. Codes within this general framework employ redundant linear precoding, and include as special cases many recently proposed algori...

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A whose decoding bound is beyond the covering radius. For these codes, we show that the maximum-likelihood decoding problem is reachable in polynomial tim...

An analysis is made of Maximum Likelihood Decoding (MLD) in a wireless Space Division Multiplexing (SDM) link, where information is transmitted and received simultaneously over several transmit and receive antennas to achieve large data rates and high spectral efficiencies. It is proven that maximum likelihood decoding obtains a diversity order equal to the number of receive antennas, independe...

We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be isometrically embedded into the hypercube with the Hamming metric, and thus, in terms of decoding, the Hamming metric is universal. keywords: Coding Theory;...