Matrices of Varied Orthogonality and Their Codes (Submitted for short presentation at ISIT'98.)
نویسنده
چکیده
Orthogonal matrices over arbitrary elds are de ned together with their non-square analogs, which are termed row-orthogonal matrices. Antiorthogonal and self-orthogonal square matrices are introduced together with their non-square analogs. The relationships of these matrices to such codes as self-dual codes and linear codes with complementary duals are given.
منابع مشابه
Codes over M2(F2) and applications to Golden space-time coded modulation
In this paper, we study code constructions over the finite ringM2(F2), the ring of 2×2 matrices with coefficients in the finite field F2. We show how they can be related to classical codes over F4. We provide as application the design of outer codes for 2 × 2 space-time coded modulation, when the inner code is the so-called Golden code.
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملMessage encoding for spread and orbit codes
Spread codes and orbit codes are special families of constant dimension subspace codes. These codes have been wellstudied for their error correction capability and transmission rate, but the question of how to encode messages has not been investigated. In this work we show how the message space can be chosen for a given code and how message enand decoding can be done.
متن کاملOrthogonality Matrices for Modulesover Finite Frobenius RingsandMacWilliams’ EquivalenceTheorem
MacWilliams’ equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19–22) where the invertibility of orthogonality matrices of finite vector spaces is the key step. The present paper revisits this technique in orde...
متن کاملSpace-Time Codes from Structured Lattices
We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of transmit antennas. We present constructions based on dense lattice packings and nested lattice (Voronoi) shaping. Our codes achieve the optimal diversity-multiplexi...
متن کامل