These invariants give rise to an easily computable criterion to check if two codes are inequivalent. With this criterion we then derive bounds on the number of ...

May 27, 2019 · These invariants give rise to an easily computable criterion to check if two codes are inequivalent. With this criterion we then derive bounds ...

Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants · Mathematics. Linear Algebra and its Applications · 2020.

Oct 15, 2020 · These invariants give rise to easily computable criteria to check if two codes are inequivalent. We derive some concrete values and bounds for ...

Sep 2, 2020 · How to check if a code is equivalent to some other code? 2. How many equivalence classes are there? 3. What distinguishing properties do these ...

These invariants give rise to an easily computable criterion to check if two codes are inequivalent. With this criterion we then derive bounds on the number of ...

Nov 29, 2019 · These invariants give rise to easily computable criteria to check if two codes are inequivalent. We derive some concrete values and bounds for ...

We obtain a class of invariants under equivalence, which can be used as an efficiently computable sufficient tool to prove inequivalence of linear rank-metric ...

Fingerprint. Dive into the research topics of 'Invariants and Inequivalence of Linear Rank-Metric Codes'. Together they form a unique fingerprint.

We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a ...