The equivalence of linear codes implies semi-linear equivalence

07/16/2021
by   Simeon Ball, et al.
0

We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2022

On additive MDS codes with linear projections

We support some evidence that a long additive MDS code over a finite fie...
research
07/24/2018

Symplectic Isometries of Stabilizer Codes

In this paper we study the equivalence of quantum stabilizer codes via s...
research
01/17/2022

A characterization of abelian group codes in terms of their parameters

In 1979, Miller proved that for a group G of odd order, two minimal grou...
research
02/04/2022

About Code Equivalence – a Geometric Approach

The equivalence test is a main part in any classification problem. It he...
research
01/26/2023

Verifying Data Constraint Equivalence in FinTech Systems

Data constraints are widely used in FinTech systems for monitoring data ...
research
08/20/2022

On the equivalence issue of a class of 2-dimensional linear Maximum Rank Distance codes

Recently A. Neri, P. Santonastaso and F. Zullo extended a family of 2-di...
research
01/19/2021

On the Decidability of Behavioral Equivalences for (P,P)-PRS

We study resource similarity and resource bisimilarity – congruent restr...

Please sign up or login with your details

Forgot password? Click here to reset