Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
From MaRDI portal
Publication:2089191
DOI10.1007/s12190-021-01594-xOpenAlexW3197104417MaRDI QIDQ2089191
Publication date: 6 October 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01594-x
Related Items (3)
Gray images of cyclic codes over \(\mathbb{Z}_{p^2}\) and \(\mathbb{Z}_p \mathbb{Z}_{p^2}\) ⋮ Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map] ⋮ Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)
Cites Work
- Two classes of optimal \(p\)-ary few-weight codes from down-sets
- Few-weight codes from trace codes over a local ring
- Linear codes from simplicial complexes
- Optimal non-projective linear codes constructed from down-sets
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- One-weight and two-weight \(\mathbb{Z}_2\mathbb{Z}_2[u,v\)-additive codes]
- Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v \)-additive cyclic codes]
- New classes of \(p\)-ary few weight codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Secret sharing schemes from three classes of linear codes
- A Generic Construction of Cartesian Authentication Codes
- Two New Families of Two-Weight Codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Minimal vectors in linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Optimal three-weight cubic codes
- A Bound for Error-Correcting Codes
This page was built for publication: Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
