Invariants for sum-rank metric codes
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new invariants for sum-rank metric codes: generalised idealisers...
Saved in:
| Published in: | Annali di matematica pura ed applicata 2025-11 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|