NEW OPTIMAL LINEAR CODES OVER
From MaRDI portal
Publication:5879224
DOI10.1017/S0004972722000399OpenAlexW4281998092MaRDI QIDQ5879224
Djoko Suprijanto, Hopein Christofen Tang
Publication date: 28 February 2023
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972722000399
Related Items (2)
Linear codes and cyclic codes over finite rings and their generalizations: a survey ⋮ A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Support weight distribution of linear codes
- Optimal self-dual codes over \(\mathbb{Z}_4\)
- Cyclic codes of length \(2^e\) over \(\mathbb Z_4\).
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\)
- On the generalized concatenated construction for codes in \(L_1\) and Lee metrics
- On constacyclic codes over \(\mathbb{Z}_4 [u / \langle u^2 - 1 \rangle\) and their Gray images]
- Codes over integer residue rings
- Codes over Zm
- Codes over Zm, revisited
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Translates of linear codes over Z/sub 4/
- Fundamentals of Error-Correcting Codes
- Maximum distance codes over rings of order 4
- Negacyclic codes over Z/sub 4/ of even length
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Algebraic Coding Theory
- OPTIMAL LINEAR CODES OVER ℤm
- An upper bound on minimum distance for a k-ary code
- Codes over certain rings
- On the classification and enumeration of self-dual codes
This page was built for publication: NEW OPTIMAL LINEAR CODES OVER
