The weight distribution of codes over finite chain rings
From MaRDI portal
Publication:6168547
DOI10.1016/j.laa.2023.06.015arXiv2210.15436OpenAlexW4381620768MaRDI QIDQ6168547
Alessio Meneghetti, Giulia Cavicchioni
Publication date: 9 August 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.15436
Cites Work
- Unnamed Item
- Unnamed Item
- Information set decoding in the Lee metric with applications to cryptography
- On the structure of linear and cyclic codes over a finite chain ring
- Note on MDS codes over the integers modulo \(p^m\)
- Weight distribution of Hermitian codes and matrices rank
- A formula on the weight distribution of linear codes with applications to AMDS codes
- On the equivalence of two post-quantum cryptographic families
- Fundamentals of Error-Correcting Codes
- Introduction to post-quantum cryptography
- On the inherent intractability of certain coding problems (Corresp.)
- Duality for modules over finite rings and applications to coding theory
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- The intractability of computing the minimum distance of a code
- MDR codes over Z/sub k/
This page was built for publication: The weight distribution of codes over finite chain rings