24 research outputs found

    Fast-decodable MIDO codes from non-associative algebras

    Get PDF
    By defining a multiplication on a direct sum of n copies of a given cyclic division algebra, we obtain new unital non-associative algebras. We employ their left multiplication to construct rate-n and rate-2 fully diverse fast ML-decodable space-time block codes for a Multiple-Input-Double-Output (MIDO) system. We give examples of fully diverse rate-2 4×2, 6×2, 8×2 and 12×2 space-time block codes and of a rate-3 6×2 code. All are fast ML-decodable. Our approach generalises the iterated codes in Markin and Oggier

    How to obtain division algebras used for fast-decodable space-time block codes

    Get PDF
    We present families of unital algebras obtained through a doubling process from a cyclic central simple algebra D, employing a K-automorphism tau and an invertible element d in D. These algebras appear in the construction of iterated space-time block codes. We give conditions when these iterated algebras are division which can be used to construct fully diverse iterated codes. We also briefly look at algebras (and codes) obtained from variations of this method

    Tensor products of nonassociative cyclic algebras

    Get PDF
    We study the tensor product of an associative and a nonassociative cyclic algebra. The condition for the tensor product to be a division algebra equals the classical one for the tensor product of two associative cyclic algebras by Albert or Jacobson, if the base field contains a suitable root of unity. Stronger conditions are obtained in special cases. Applications to space–time block coding are discussed

    How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A

    Get PDF
    We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases

    The nonassociative algebras used to build fast-decodable space-time block codes

    Get PDF
    Let K/F and K/L be two cyclic Galois field extensions and D a cyclic algebra. Given an invertible element d in D, we present three families of unital nonassociative algebras defined on the direct sum of n copies of D. Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes in papers by Srinath, Rajan, Markin, Oggier, and the authors. We present conditions for the algebras to be division and propose a construction for fully diverse fast decodable space-time block codes of rate-m for nm transmit and m receive antennas. We present a DMT-optimalrate-3 code for 6 transmit and 3 receive antennas which is fast-decodable, with ML-decoding complexity at most O(M^15)

    Nonassociative cyclic extensions of fields and central simple algebras

    Get PDF
    We define nonassociative cyclic extensions of degree m of both fields andcentral simple algebras over fields. If a suitable field contains a primitive mth (resp., qth) root of unity, we show that suitable nonassociative generalized cyclic division algebras yield nonassociative cyclic extensions of degree m (resp., qs). Some of Amitsur's classical results on non-commutative associative cyclic extensions of both fields and central simple algebras are obtained as special cases
    corecore