Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map
From MaRDI portal
Publication:6056737
DOI10.1016/j.disc.2023.113650OpenAlexW4385975628MaRDI QIDQ6056737
Pramod Kumar Kewat, Nilay Kumar Mondal
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113650
simplicial complexesoptimal codesminimal codesself-orthogonal codesfew-Lee weight codesmixed alphabet ring
Cites Work
- One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes
- How to build robust shared control systems
- Linear codes from simplicial complexes
- Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets]
- 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
- 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]
- Two families of two-weight codes over \(\mathbb{Z}_4\)
- Linear Codes From Some 2-Designs
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- A Generic Construction of Cartesian Authentication Codes
- Fundamentals of Error-Correcting Codes
- The Geometry of Two-Weight Codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Minimal vectors in linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Five-weight codes from three-valued correlation of M-sequences
This page was built for publication: Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map
