About Code Equivalence – a Geometric Approach

02/04/2022
by   Iliya Bouyukliev, et al.
0

The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for equivalence of linear codes, based on their relation to multisets of points in a projective geometry.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2021

A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

Recently, a new algorithm to test equivalence of two cyclic codes has be...
research
07/16/2021

The equivalence of linear codes implies semi-linear equivalence

We prove that if two linear codes are equivalent then they are semi-line...
research
03/10/2018

Efficient Determination of Equivalence for Encrypted Data

Secure computation of equivalence has fundamental application in many di...
research
06/24/2022

On Donoho's Log-Exp Subdivision Scheme: Choice of Retraction and Time-Symmetry

In recent years a number of different approaches for adapting linear sub...
research
06/08/2022

Parametric Lie group structures on the probabilistic simplex and generalized Compositional Data

In this paper we build a set of parametric quotient Lie group structures...
research
01/19/2021

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

We study resource similarity and resource bisimilarity – congruent restr...
research
12/07/2022

Why the equivalence problem for unambiguous grammars has not been solved back in 1966?

In 1966, Semenov, by using a technique based on power series, suggested ...

Please sign up or login with your details

Forgot password? Click here to reset