New classes of binary few weight codes from trace codes over a chain ring
From MaRDI portal
Publication:2142555
DOI10.1007/s12190-021-01549-2zbMath1501.94091OpenAlexW3185630778MaRDI QIDQ2142555
Publication date: 27 May 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-01549-2
Related Items
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
- Unnamed Item
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Optimal binary codes from trace codes over a non-chain ring
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Two classes of optimal \(p\)-ary few-weight codes from down-sets
- 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
- Optimal minimal linear codes from posets
- New classes of \(p\)-ary few weight codes
- Linear Codes From Some 2-Designs
- How to share a secret
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Cartesian Authentication Codes
- The Geometry of Two-Weight 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
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$
- Optimal three-weight cubic codes
- A Bound for Error-Correcting Codes
