A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)
From MaRDI portal
Publication:2701488
DOI10.1007/s10623-022-01176-3OpenAlexW4313909795MaRDI QIDQ2701488
Hopein Christofen Tang, Djoko Suprijanto
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.00324
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Support weight distribution of linear codes
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- Two families of two-weight codes over \(\mathbb{Z}_4\)
- Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
- Weights of linear codes and strongly regular normed spaces
- Two infinite families of two-weight codes over \(\mathbb{Z}_{2^{m}}\)
- A Note on One Weight and Two Weight Projective $\mathbb {Z}_{4}$ -Codes
- On Uniformly Packed [n , n -k , 4 Codes over GF(q ) and a Class of Caps in PG(k -1, q )]
- The Geometry of Two-Weight Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Two New Families of Two-Weight Codes
- The Geometry of Two-Weight Codes Over ℤpm
- An upper bound on minimum distance for a k-ary code
- NEW OPTIMAL LINEAR CODES OVER
This page was built for publication: A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)