American Institute of Mathematical Sciences

Advanced
May  2008, 2(2): 131-145. doi: 10.3934/amc.2008.2.131

The equivalence of space-time codes and codes defined over finite fields and Galois rings

David Grant 1, and  Mahesh K. Varanasi 2,

1. 

Department of Mathematics, University of Colorado at Boulder, Boulder, CO 80309-0395
2. 

Department of Electrical and Computer Engineering, University of Colorado at Boulder, Boulder, CO 80309-0425, United States

Received  October 2007 Revised  April 2008 Published  April 2008

Space-time codes for a wide variety of channels have the property that the diversity of a pair of codeword matrices is measured by the vanishing or non-vanishing of polynomials in the entries of the matrices. We show that for every such channel: I) There is an appropriately-defined notion of approximation of space-time codes such that each code is arbitrarily well approximated by one whose alphabet lies in the field of algebraic numbers; II) Each space-time code whose alphabet lies in the field of algebraic numbers is an appropriately-defined lift from a corresponding space-time code defined over a finite field or a ''scaled'' lift from a Galois ring of arbitrary characteristic. This implies that all space-time codes can be designed over finite fields or over Galois rings of arbitrary characteristic and then lifted to complex matrices with entries in a number field.
Keywords: Space-time codes, Galois rings., finite fields.
Mathematics Subject Classification: 94B60, 11T71, 14G5.
Citation: David Grant, Mahesh K. Varanasi. The equivalence of space-time codes and codes defined over finite fields and Galois rings. Advances in Mathematics of Communications, 2008, 2 (2) : 131-145. doi: 10.3934/amc.2008.2.131
[1]

David Grant, Mahesh K. Varanasi. Duality theory for space-time codes over finite fields. Advances in Mathematics of Communications, 2008, 2 (1) : 35-54. doi: 10.3934/amc.2008.2.35
[2]

Hassan Khodaiemehr, Dariush Kiani. High-rate space-time block codes from twisted Laurent series rings. Advances in Mathematics of Communications, 2015, 9 (3) : 255-275. doi: 10.3934/amc.2015.9.255
[3]

Vincent Astier, Thomas Unger. Galois extensions, positive involutions and an application to unitary space-time coding. Advances in Mathematics of Communications, 2019, 13 (3) : 513-516. doi: 10.3934/amc.2019032
[4]

Delphine Boucher, Patrick Solé, Felix Ulmer. Skew constacyclic codes over Galois rings. Advances in Mathematics of Communications, 2008, 2 (3) : 273-292. doi: 10.3934/amc.2008.2.273
[5]

Susanne Pumplün, Thomas Unger. Space-time block codes from nonassociative division algebras. Advances in Mathematics of Communications, 2011, 5 (3) : 449-471. doi: 10.3934/amc.2011.5.449
[6]

Frédérique Oggier, B. A. Sethuraman. Quotients of orders in cyclic algebras and space-time codes. Advances in Mathematics of Communications, 2013, 7 (4) : 441-461. doi: 10.3934/amc.2013.7.441
[7]

Grégory Berhuy. Algebraic space-time codes based on division algebras with a unitary involution. Advances in Mathematics of Communications, 2014, 8 (2) : 167-189. doi: 10.3934/amc.2014.8.167
[8]

Sergio R. López-Permouth, Steve Szabo. On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings. Advances in Mathematics of Communications, 2009, 3 (4) : 409-420. doi: 10.3934/amc.2009.3.409
[9]

Minjia Shi, Daitao Huang, Lin Sok, Patrick Solé. Double circulant self-dual and LCD codes over Galois rings. Advances in Mathematics of Communications, 2019, 13 (1) : 171-183. doi: 10.3934/amc.2019011
[10]

Igor E. Shparlinski. On some dynamical systems in finite fields and residue rings. Discrete & Continuous Dynamical Systems - A, 2007, 17 (4) : 901-917. doi: 10.3934/dcds.2007.17.901
[11]

Susanne Pumplün, Andrew Steele. The nonassociative algebras used to build fast-decodable space-time block codes. Advances in Mathematics of Communications, 2015, 9 (4) : 449-469. doi: 10.3934/amc.2015.9.449
[12]

Susanne Pumplün. How to obtain division algebras used for fast-decodable space-time block codes. Advances in Mathematics of Communications, 2014, 8 (3) : 323-342. doi: 10.3934/amc.2014.8.323
[13]

Aicha Batoul, Kenza Guenda, T. Aaron Gulliver. Some constacyclic codes over finite chain rings. Advances in Mathematics of Communications, 2016, 10 (4) : 683-694. doi: 10.3934/amc.2016034
[14]

Somphong Jitman, San Ling, Patanee Udomkavanich. Skew constacyclic codes over finite chain rings. Advances in Mathematics of Communications, 2012, 6 (1) : 39-63. doi: 10.3934/amc.2012.6.39
[15]

Eimear Byrne. On the weight distribution of codes over finite rings. Advances in Mathematics of Communications, 2011, 5 (2) : 395-406. doi: 10.3934/amc.2011.5.395
[16]

Georgios T. Kossioris, Georgios E. Zouraris. Finite element approximations for a linear Cahn-Hilliard-Cook equation driven by the space derivative of a space-time white noise. Discrete & Continuous Dynamical Systems - B, 2013, 18 (7) : 1845-1872. doi: 10.3934/dcdsb.2013.18.1845
[17]

Yuming Zhang. On continuity equations in space-time domains. Discrete & Continuous Dynamical Systems - A, 2018, 38 (10) : 4837-4873. doi: 10.3934/dcds.2018212
[18]

Thomas Westerbäck. Parity check systems of nonlinear codes over finite commutative Frobenius rings. Advances in Mathematics of Communications, 2017, 11 (3) : 409-427. doi: 10.3934/amc.2017035
[19]

Gerard A. Maugin, Martine Rousseau. Prolegomena to studies on dynamic materials and their space-time homogenization. Discrete & Continuous Dynamical Systems - S, 2013, 6 (6) : 1599-1608. doi: 10.3934/dcdss.2013.6.1599
[20]

Dmitry Turaev, Sergey Zelik. Analytical proof of space-time chaos in Ginzburg-Landau equations. Discrete & Continuous Dynamical Systems - A, 2010, 28 (4) : 1713-1751. doi: 10.3934/dcds.2010.28.1713

2018 Impact Factor: 0.879

Tools

Metrics

  • PDF downloads (4)
  • HTML views (0)
  • Cited by (1)

Other articles
by authors

[Back to Top]

Copyright © 2019 American Institute of Mathematical Sciences