Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
From MaRDI portal
Publication:2341578
DOI10.1007/s11424-014-2188-8zbMath1316.94111MaRDI QIDQ2341578
Publication date: 27 April 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-2188-8
94B05: Linear codes (general theory)
Related Items
Linear codes over \({\mathbb{F}}_3+u\mathbb{F}_3+u^2\mathbb{F}_3\): MacWilliams identities, optimal ternary codes from one-Lee weight codes and two-Lee weight codes, Optimal \(p\)-ary codes from one-weight and two-weight codes over \(\mathbb{F}_p + v\mathbb{F}_p^* \), Construction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\), On two-weight \(\mathbb {Z}_{2^k}\)-codes, Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \), Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes, Three-weight codes over rings and strongly walk regular graphs, One-weight and two-weight \(\mathbb{Z}_2\mathbb{Z}_2[u,v\)-additive codes], Two families of two-weight codes over \(\mathbb{Z}_4\), Two infinite families of two-weight codes over \(\mathbb{Z}_{2^{m}}\), A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\), Construction of two-Lee weight codes over
Cites Work
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u/\langle u^m\rangle\)]
- Projective two-weight codes with small parameters and their corresponding graphs
- Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes
- Ring geometries, two-weight codes, and strongly regular graphs
- The correspondence between projective codes and 2-weight codes
- On perfect ternary constant weight codes
- New classes of 2-weight cyclic codes
- Projective two-weight irreducible cyclic and constacyclic codes
- The structure of linear codes of constant weight
- Are<tex>$2$</tex>-Weight Projective Cyclic Codes Irreducible?
- The Geometry of Two-Weight Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
