English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

As a result of their applications in network coding, space-time coding, andcoding for criss-cross errors, matrix codes have garnered significantattention; in various contexts, these codes have also been termed rank-metriccodes, space-time codes over finite fields, and array codes. We focus oncharacterizing matrix codes that are both efficient (have high rate) andeffective at error correction (have high minimum rank-distance). It is wellknown that the inherent trade-off between dimension and minimum distance for amatrix code is reversed for its dual code; specifically, if a matrix code hashigh dimension and low minimum distance, then its dual code will have lowdimension and high minimum distance. With an aim towards finding codes with aperfectly balanced trade-off, we study self-dual matrix codes. In this work, wedevelop a framework based on double cosets of the matrix-equivalence maps toprovide a complete classification of the equivalence classes of self-dualmatrix codes, and we employ this method to enumerate the equivalence classes ofthese codes for small parameters.

An Enumeration of the Equivalence Classes of Self-Dual Matrix Codes