Asymptotically optimal matrix codes with Hamming and rank distances

DOI10.1016/J.AAM.2021.102264zbMATH Open1498.94105OpenAlexW3187215253MaRDI QIDQ820933FDOQ820933

Authors: 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

Recommendations

• Asymptotic behaviour of codes in rank metric over finite fields
• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• Construction and bound on the performance of matrix-product codes
• Hermitian rank distance codes
• Hamming and simplex codes for the sum-rank metric

zbMATH Keywords

Hamming distancerank distancematrix codesmaximality argument

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
• On Hamming distance matrix

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

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