Higher genus universally decodable matrices (UDMG)
From MaRDI portal
(Redirected from Publication:476349)
Abstract: We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows, and a linear independence condition satisfied by collections of K+g columns formed from the initial segments of the matrices. We consider the mathematical structure of UDMGs and their relation to linear vector codes. We then give a construction of UDMG based on curves of genus g over the finite field, which is a natural generalization of the UDM constructed in [8]. We provide upper (and constructable lower) bounds for L in terms of K, q, g, and the number of columns of the matrices. We will show there is a fundamental trade off (Theorem 5.4) between L and g, akin to the Singleton bound for the minimal Hamming distance of linear vector codes.
Recommendations
Cites work
- A class of Sudan-decodable codes
- A probabilistic interpretation of the final rankings in AHP
- Approximately universal codes over slow-fading channels
- Codes of small defect
- Fundamentals of Wireless Communication
- scientific article; zbMATH DE number 1478667 (Why is no real title available?)
- scientific article; zbMATH DE number 1795934 (Why is no real title available?)
- On the Existence of Universally Decodable Matrices
- On universally decodable matrices for space-time coding
- The Arithmetic of Elliptic Curves
Cited in
(2)
This page was built for publication: Higher genus universally decodable matrices (UDMG)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476349)