The equivalence of linear codes implies semi-linear equivalence
From MaRDI portal
Publication:2153748
DOI10.1007/s10623-022-01055-xOpenAlexW3185915302WikidataQ114849733 ScholiaQ114849733MaRDI QIDQ2153748
Publication date: 13 July 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.07912
Cites Work
- Unnamed Item
- Unnamed Item
- Further results on the classification of MDS codes
- The relative generalized Hamming weight and the semilinear equivalence of codes
- (6,3)-MDS codes over an alphabet of size 4
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- On the Classification of MDS Codes
- Fundamentals of Error-Correcting Codes
- Computer Classification of Linear Codes
- On additive MDS codes over small fields
This page was built for publication: The equivalence of linear codes implies semi-linear equivalence