The equivalence of linear codes implies semi-linear equivalence
View/Open
Cita com:
hdl:2117/377575
Document typeArticle
Defense date2022-07-01
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
ProjectCOMBINATORIA GEOMETRICA, ALGEBRAICA Y PROBABILISTICA (AEI-MTM2017-82166-P)
COMBINATORIA: NUEVAS TENDENCIAS Y APLICACIONES (AEI-PID2020-113082GB-I00)
COMBINATORIA: NUEVAS TENDENCIAS Y APLICACIONES (AEI-PID2020-113082GB-I00)
Abstract
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.
Description
The version of record is available online at: 10.1007/s10623-022-01055-x
CitationBall, S.; Dixon, J. The equivalence of linear codes implies semi-linear equivalence. "Designs codes and cryptography", 1 Juliol 2022, vol. 90, núm. 7, p. 1557-1565.
ISSN0925-1022
Publisher versionhttps://link.springer.com/article/10.1007/s10623-022-01055-x
Files | Description | Size | Format | View |
---|---|---|---|---|
codeequivalence.pdf | 185,3Kb | View/Open |