Optimal minimal linear codes from posets
From MaRDI portal
Publication:2211330
Abstract: Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun {em et al.} We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes. In this paper, we present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes associated with hierarchical posets with two levels. Based on these results, we also obtain some optimal and minimal binary linear codes not satisfying the condition of Ashikhmin-Barg.
Recommendations
- Optimal binary linear codes from posets of the disjoint union of two chains
- Optimal non-projective linear codes constructed from down-sets
- Linear codes from simplicial complexes
- Two classes of optimal p-ary few-weight codes from down-sets
- Minimal binary linear codes: a general framework based on bent concatenation
Cites work
- A Bound for Error-Correcting Codes
- A construction of binary linear codes from Boolean functions
- Complete weight enumerators of a class of linear codes with two or three weights
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes from simplicial complexes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Minimal Binary Linear Codes
- Minimal linear codes in odd characteristic
- Minimal linear codes over finite fields
- Minimal vectors in linear codes
- On minimal and quasi-minimal linear codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Searching for linear codes with large minimum distance
- Secret sharing schemes from three classes of linear codes
- Towards secure two-party computation from the wire-tap channel
- Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
- Weight enumerators of reducible cyclic codes and their dual codes
Cited in
(14)- Linear codes from simplicial complexes
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Few-weight quaternary codes via simplicial complexes
- New classes of binary few weight codes from trace codes over a chain ring
- Octanary linear codes using simplicial complexes
- Optimal binary linear codes from posets of the disjoint union of two chains
- Minimal and optimal binary codes obtained using \(C_D\)-construction over the non-unital ring \(I\)
- Several classes of new projective three-weight or four-weight linear codes and their applications in s-sum sets
- Linear codes from simplicial complexes over \(\mathbb{F}_{2^n}\)
- Minimal linear codes constructed from hierarchical posets with two levels
- Optimal few-weight codes and their subfield codes
- A new family of minimal linear codes from simplicial complexes
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Linear codes over \(\mathbb{Z}_{p^2}\) with few-weight from down-sets
This page was built for publication: Optimal minimal linear codes from posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211330)
