Construction of high rate \(\mathcal {T}\)-direct codes

DOI10.1007/S40314-018-0665-8zbMath1413.94058OpenAlexW2808206188MaRDI QIDQ1715650

Hongjun Xu, R. S. Raja Durai, Meenakshi Devi

Publication date: 29 January 2019

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-018-0665-8

zbMATH Keywords

minimum distanceinformation raterank metricmaximum rank distance codes\(\mathcal {T}\)-direct codesmulti-user codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Theory of codes with maximum rank distance
• Linear codes with complementary duals
• A coding scheme that increases the code rate
• Erasure Techniques in MRD codes
• On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
• Packing and Covering Properties of Rank Metric Codes
• Self-Complementary Normal Bases in Finite Fields
• Maximum distance<tex>q</tex>-nary codes

This page was built for publication: Construction of high rate \(\mathcal {T}\)-direct codes