Two classes of optimal \(p\)-ary few-weight codes from down-sets
From MaRDI portal
Publication:827599
DOI10.1016/j.dam.2020.10.027zbMath1483.94070OpenAlexW3112679348MaRDI QIDQ827599
Publication date: 13 January 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.027
Related Items
Small Strong Blocking Sets by Concatenation ⋮ Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ A unified construction of optimal and distance optimal two or three-weight codes ⋮ Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets]
Cites Work
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- A class of constacyclic codes over \(\mathbb F_{p}+v\mathbb F_{p}\) and its Gray image
- Optimal binary codes from trace codes over a non-chain ring
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Three-weight cyclic codes and their weight distributions
- How to build robust shared control systems
- Few-weight codes from trace codes over a local ring
- Linear codes from simplicial complexes
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- Optimal non-projective linear codes constructed from down-sets
- Several new classes of linear codes with few weights
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- Linear Codes From Some 2-Designs
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Cartesian Authentication Codes
- Two New Families of Two-Weight Codes
- Minimal vectors in linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$
- A Bound for Error-Correcting Codes
