On the hardness of code equivalence problems in rank metric

by   Alain Couvreur, et al.

In recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network coding or public key cryptography. These applications raised the interest of the community for theoretical properties of this type of codes, such as the hardness of decoding in rank metric or better decoding algorithms. Among classical problems associated to codes for a given metric, the notion of code equivalence has always been of the greatest interest. In this article, we discuss the hardness of the code equivalence problem in rank metric for 𝔽_q^m–linear and general rank metric codes. In the 𝔽_q^m–linear case, we reduce the underlying problem to another one called Matrix Codes Right Equivalence Problem (MCREP). We prove the latter problem to be either in 𝒫 or in 𝒵𝒫𝒫 depending of the ground field size. This is obtained by designing an algorithm whose principal routines are linear algebra and factoring polynomials over finite fields. It turns out that the most difficult instances involve codes with non trivial stabilizer algebras. The resolution of the latter case will involve tools related to finite dimensional algebras and the so–called Wedderburn–Artin theory. It is interesting to note that 30 years ago, an important trend in theoretical computer science consisted to design algorithms making effective major results of this theory. These algorithmic results turn out to be particularly useful in the present article. Finally, for general matrix codes, we prove that the equivalence problem (both left and right) is at least as hard as the well–studied Monomial Equivalence Problem for codes endowed with the Hamming metric.



There are no comments yet.


page 1

page 2

page 3

page 4


Solving the Rank Decoding Problem Over Finite Principal Ideal Rings

The rank decoding problem has been the subject of much attention in this...

Rank-metric codes

This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theo...

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

We speed up existing decoding algorithms for three code classes in diffe...

Invariants and Inequivalence of Linear Rank-Metric Codes

We show that the sequence of dimensions of the linear spaces, generated ...

Theory of supports for linear codes endowed with the sum-rank metric

The sum-rank metric naturally extends both the Hamming and rank metrics ...

Reed-Muller Codes: Theory and Algorithms

Reed-Muller (RM) codes are among the oldest, simplest and perhaps most u...

Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial

The paper deals with the problem of deciding if two finite-dimensional l...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.