Simplex and MacDonald codes over R_q
From MaRDI portal
Publication:1677147
DOI10.1007/S12190-016-1045-4zbMATH Open1405.94130arXiv1505.05428OpenAlexW2097094277MaRDI QIDQ1677147FDOQ1677147
Authors: Peng Zhang
Publication date: 10 November 2017
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Abstract: In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring for . We also consider the construction of simplex and MacDonald codes of types and over this ring.
Full work available at URL: https://arxiv.org/abs/1505.05428
Recommendations
- scientific article; zbMATH DE number 2213408
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q]/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications
- scientific article; zbMATH DE number 5575566
- Covering radius of linear codes over ring \(F_q+uF_q+u^2F_q+\cdots +u^{k-1}F_q\)
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Characterization of finite Frobenius rings
- Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\)
- Codes over \(R_k\), Gray maps and their binary images
- Linear codes over \({\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}\)
- Covering radius---Survey and recent results
- Self-dual codes over \(\mathbb{Z}_8\) and \(\mathbb{Z}_9\)
- On the covering radius of Z/sub 4/-codes and their lattices
- On the covering radius of some modular codes
- Title not available (Why is that?)
- Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
- Title not available (Why is that?)
- The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes
Cited In (9)
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- DNA multi-secret sharing schemes based on linear codes over \(\mathbb{Z}_4 \times R\)
- Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes
- Simplex codes of type \(\gamma \) over \(F_3+vF_3\)
- Algorithms and codes for the Macdonald function: Recent progress and comparisons.
- Structure of linear codes over the ring \(B_k\)
- Linear codes over \(\mathbb{Z}_p\mathcal{R}_1 \mathcal{R}_2\) and their applications
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q]/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications
- Unit \(\mathbb{Z}_q\)-simplex codes of type \(\alpha\) and zero divisor \(\mathbb{Z}_q\)-simplex codes
This page was built for publication: Simplex and MacDonald codes over \(R_q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677147)