Constructing optimal few weight quaternary linear codes via multivariable functions
From MaRDI portal
Cites work
- A class of low-rate nonlinear binary codes
- A class of optimum nonlinear double-error-correcting codes
- A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)
- An upper bound on minimum distance for a k-ary code
- Construction of minimal linear codes from multi-variable functions
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 1461530 (Why is no real title available?)
- NEW OPTIMAL LINEAR CODES OVER
- New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image
- Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
- Shortened BCH codes (Corresp.)
- Shortened Linear Codes Over Finite Fields
- The Geometry of Two-Weight Codes Over ℤpm
- The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Three-weight codes over rings and strongly walk regular graphs
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- Two families of two-weight codes over \(\mathbb{Z}_4\)
- Two infinite families of two-weight codes over \(\mathbb{Z}_{2^{m}}\)
This page was built for publication: Constructing optimal few weight quaternary linear codes via multivariable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016068)
