Linear codes from simplicial complexes
From MaRDI portal
Publication:1671630
DOI10.1007/s10623-017-0442-5zbMath1408.94978OpenAlexW2770029325MaRDI QIDQ1671630
Seunghwan Chang, Jong Yoon Hyun
Publication date: 6 September 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0442-5
simplicial complexbinary linear codeBoolean functionWalsh-Hadamard transformsecret sharing schemeoptimal linear codeminimal linear code
Related Items (35)
An inductive construction of minimal codes ⋮ Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Secret sharing schemes based on the dual of Golay codes ⋮ Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal gray image ⋮ Two classes of optimal \(p\)-ary few-weight codes from down-sets ⋮ Minimal linear codes from weakly regular bent functions ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Few-weight quaternary codes via simplicial complexes ⋮ Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\) ⋮ New classes of binary few weight codes from trace codes over a chain ring ⋮ Three-weight minimal linear codes ⋮ On the weight distribution of some minimal codes ⋮ Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\) ⋮ Two classes of few-Lee weight \(\mathbb{Z}_2 [u\)-linear codes using simplicial complexes and minimal codes via Gray map] ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Octanary linear codes using simplicial complexes ⋮ Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\) ⋮ Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\) ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Minimal linear codes from Hermitian varieties and quadrics ⋮ A note on the minimal binary linear code ⋮ A family of distance-optimal minimal linear codes with flexible parameters ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Optimal minimal linear codes from posets ⋮ Construction of two- or three-weight binary linear codes from Vasil'ev codes ⋮ Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents ⋮ Minimal linear codes arising from blocking sets ⋮ Construction of minimal linear codes from multi-variable functions ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class ⋮ Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ Minimal linear codes over finite fields ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ A family of linear codes from constant dimension subspace codes ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u\)-additive codes from down-sets]
Cites Work
- Unnamed Item
- Nonlinearities of S-boxes
- On Minimal and Quasi-minimal Linear Codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- How to share a secret
- Face Numbers of Down-Sets
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Minimal vectors in linear codes
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
This page was built for publication: Linear codes from simplicial complexes
