Asymptotically optimal matrix codes with Hamming and rank distances

DOI10.1016/J.AAM.2021.102264zbMath1498.94105OpenAlexW3187215253MaRDI QIDQ820933

Ghurumuruhan Ganesan

Publication date: 29 September 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2021.102264

zbMATH Keywords

Hamming distancerank distancematrix codesmaximality argument

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Other types of codes (94B60) Distance in graphs (05C12) Communication theory (94A05)

Cites Work

• Full-diversity, high-rate space-time block codes from division algebras
• Perfect Space–Time Block Codes
• Fundamentals of Error-Correcting Codes
• Space-time block codes from orthogonal designs

This page was built for publication: Asymptotically optimal matrix codes with Hamming and rank distances