2019/05/27 by Alessandro Neri, Neri, Alessandro, Sven Puchinger +4 · 2 citations
Computer Science · Mathematics · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1905.11326
5 pages; accepted at IEEE International Symposium on Information Theory 2019
arxiv created 2019/05/27 · openalex publication_date 2019/05/27 · arxiv updated 2019/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These invariants give rise to an easily computable criterion to check if two codes are inequivalent. With this criterion we then derive bounds on the number of equivalence classes of classical and twisted Gabidulin codes.