On ℤq-linear and ℤq-Simplex codes and its related parameters forqis a prime power
From MaRDI portal
Publication:5069687
DOI10.1080/09720529.2014.903699OpenAlexW2032634586MaRDI QIDQ5069687
No author found.
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2014.903699
covering radiuscodes over finite rings\( \mathbb{Z}_q\)-linear code\( \mathbb{Z}_q\)-MacDonald code\( \mathbb{Z}_q\)-simplex code
Linear codes (general theory) (94B05) Lattice packing and covering (number-theoretic aspects) (11H31)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- On the covering radius of some modular codes
- Self-dual codes over the integers modulo 4
- Self-dual codes over rings and the Chinese remainder theorem
- Type II self-dual codes over finite rings and even unimodular lattices
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Type II codes over Z/sub 4/
- On the covering radius of Z/sub 4/-codes and their lattices
- Type II codes over F/sub 2/+uF/sub 2/
- Cyclic codes and self-dual codes over F/sub 2/+uF/sub 2/
This page was built for publication: On ℤq-linear and ℤq-Simplex codes and its related parameters forqis a prime power