ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH

DOI10.1142/9789811248108_0006MaRDI QIDQ6178017zbMATH OpenOpenAlexFDO

Authors Iliya G. Bouyukliev, Stefka Bouyuklieva

Publication date 1 September 2023

Published in New Horizons in Differential Geometry and its Related Fields (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.02086

zbMATH Keywords

equivalencelinear codeisomorphismsGalois geometry

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: 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.

Recommendations

• About the code equivalence
• Complexity and approximation for discriminating and identifying code problems in geometric setups
• scientific article; zbMATH DE number 1795249
• scientific article; zbMATH DE number 1001746
• On the orthogonality of geometric codes
• scientific article; zbMATH DE number 4161558
• Equality of geometric Goppa codes and equivalence of divisors
• Discriminating Codes in Geometric Setups
• Geometric representations of linear codes
• scientific article; zbMATH DE number 65890

Cited in

(2)

• About the code equivalence
• On equivalence of two tests for codes

This page was built for publication: ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178017)