Two families of few-weight codes over a finite chain ring
From MaRDI portal
Publication:6041875
DOI10.1016/J.DISC.2023.113464zbMATH Open1525.94063OpenAlexW4366979780MaRDI QIDQ6041875FDOQ6041875
Authors: Sihem Mesnager, Liqin Qian, Xiwang Cao 
Publication date: 15 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113464
Recommendations
- Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\)
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- New classes of \(p\)-ary few weight codes
- Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications
- New classes of binary few weight codes from trace codes over a chain ring
Cites Work
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The Geometry of Two-Weight Codes
- A metric for codes over residue class rings
- Weighted modules and representations of codes
- Secret sharing schemes from three classes of linear codes
- Fundamentals of Error-Correcting Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Title not available (Why is that?)
- Minimal vectors in linear codes
- Type II codes over F/sub 2/+uF/sub 2/
- A Bound for Error-Correcting Codes
- Kerdock code in a cyclic form
- Ring geometries, two-weight codes, and strongly regular graphs
- Title not available (Why is that?)
- A coding theory construction of new systematic authentication codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- Type IV self-dual codes over rings
- Code equivalence characterizes finite Frobenius rings
- Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
- Title not available (Why is that?)
- Two classes of two-weight linear codes
- Homogeneous weights and exponential sums.
- Optimal binary codes from trace codes over a non-chain ring
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- Few-weight codes from trace codes over a local ring
- Two New Families of Two-Weight Codes
- On constacyclic codes over \(\mathbb{Z}_4 [u] / \langle u^2 - 1 \rangle\) and their Gray images
- Codes and rings. Theory and practice
- Five classes of optimal two-weight linear codes
- New classes of \(p\)-ary few weight codes
- Binary linear codes with two or three weights from Niho exponents
- All Reed-Muller codes are linearly representable over the ring of dual numbers over Z/sub 2/
- A family of projective two-weight linear codes
- Weight distribution of trace codes over finite rings
Cited In (2)
This page was built for publication: Two families of few-weight codes over a finite chain ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041875)
