Linear codes from simplicial complexes

2017 ◽  
Vol 86 (10) ◽  
pp. 2167-2181 ◽  
Author(s):  
Seunghwan Chang ◽  
Jong Yoon Hyun
Keyword(s):  
Linear Codes ◽  
Simplicial Complexes

scholarly journals New classes of few-weight ternary codes from simplicial complexes

2021 ◽  
Vol 7 (3) ◽  
pp. 4315-4325
Author(s):  
Yang Pan ◽  
◽  
Yan Liu ◽  
Keyword(s):  
Weight Distribution ◽  
Linear Codes ◽  
Minimum Weight ◽  
Simplicial Complexes ◽  
Mathematical Objects ◽  
First Order ◽  
Ternary Codes

<abstract><p>In this article, we describe two classes of few-weight ternary codes, compute their minimum weight and weight distribution from mathematical objects called simplicial complexes. One class of codes described here has the same parameters with the binary first-order Reed-Muller codes. A class of (optimal) minimal linear codes is also obtained in this correspondence.</p></abstract>

Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes

10.37236/1245 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Art M. Duval
Keyword(s):  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Pure Case ◽  
Definition Of ◽  
Algebraic Shifting

Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the $h$-triangle, a doubly-indexed generalization of the $h$-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generalize the Cohen-Macaulay conditions for pure complexes, so that a nonpure shellable complex is sequentially Cohen-Macaulay. We show that algebraic shifting preserves the $h$-triangle of a simplicial complex $K$ if and only if $K$ is sequentially Cohen-Macaulay. This generalizes a result of Kalai's for the pure case. Immediate consequences include that nonpure shellable complexes and sequentially Cohen-Macaulay complexes have the same set of possible $h$-triangles.

Two-Weight Linear Codes and Their Applications in Secret Sharing

2019 ◽  
Vol 28 (4) ◽  
pp. 706-711
Author(s):  
Yaru Wang ◽  
Fulin Li ◽  
Shixin Zhu
Keyword(s):  
Secret Sharing ◽  
Linear Codes

scholarly journals Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

2021 ◽  
pp. 1-1
Author(s):  
Chunming Tang ◽  
Yan Qiu ◽  
Qunying Liao ◽  
Zhengchun Zhou
Keyword(s):  
Linear Codes ◽  
Blocking Sets ◽  
Full Characterization
Sign in / Sign up

Export Citation Format

Share Document