On universally decodable matrices for space-time coding

DOI10.1007/S10623-006-9019-4MaRDI QIDQ2383973zbMATH OpenOpenAlexFDO

Authors Pascal O. Vontobel, Ashwin Ganesan

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0601075

zbMATH Keywords

Coding for slow-fading channelsEfficient decodingHasse derivativesNewton interpolationPascal's triangleRank conditionReed-Solomon codesRepeated-root cyclic codesRosenbloom-Tsfasman metricUniversally decodable matrices

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Abstract: The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of constructing maximum distance separable (MDS) codes. In this paper, we first study the properties of UDMs in general and then we discuss an explicit construction of a class of UDMs, a construction which can be seen as an extension of Reed-Solomon codes. In fact, we show that this extension is, in a sense to be made more precise later on, unique. Moreover, the structure of this class of UDMs allows us to answer some open conjectures by Tavildar, Viswanath, and Doshi in the positive, and it also allows us to formulate an efficient decoding algorithm for this class of UDMs. It turns out that our construction yields a coding scheme that is essentially equivalent to a class of codes that was proposed by Rosenbloom and Tsfasman. Moreover, we point out connections to so-called repeated-root cyclic codes.

Recommendations

• Higher genus universally decodable matrices (UDMG)
• On the Existence of Universally Decodable Matrices
• On the characterization of linear uniquely decodable codes
• Universal space-time coding
• scientific article; zbMATH DE number 1498796

Cites work

• A class of Sudan-decodable codes
• A note on repeated-root cyclic codes
• Algebraic function fields and codes
• Approximately universal codes over slow-fading channels
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• Binomial Coefficients Modulo a Prime
• Explicit constructions in the classical mean squares problem in irregularities of point distribution
• Fundamentals of Wireless Communication
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1795934 (Why is no real title available?)
• scientific article; zbMATH DE number 3272331 (Why is no real title available?)
• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• On repeated-root cyclic codes
• On universally decodable matrices for space-time coding
• Repeated-root cyclic codes
• Tables of curves with many points
• The automorphism group of a linear space with the Rosenbloom-Tsfasman metric

Cited in

(8)

• On the complexity of decomposing matrices arising in satellite communication
• Hierarchical erasure correction of linear codes
• On universally decodable matrices for space-time coding
• On the Existence of Universally Decodable Matrices
• Existence and construction of noncoherent unitary space-time codes
• Higher genus universally decodable matrices (UDMG)
• Codes Over Matrix Rings for Space-Time Coded Modulations
• Universal trellis codes for diagonally layered space-time systems

Describes a project that uses

Uses Software

• manYPoints

This page was built for publication: On universally decodable matrices for space-time coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383973)