Several classes of linear codes with a few weights from defining sets over $$\mathbb {F}_p+u\mathbb {F}_p$$ F p + u F p

2018 ◽  
Vol 87 (1) ◽  
pp. 15-29 ◽  
Author(s):  
Haibo Liu ◽  
Qunying Liao
Keyword(s):  
Linear Codes ◽  
Defining Sets

scholarly journals Two-weight and three-weight linear codes constructed from Weil sums

2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Tonghui Zhang ◽  
Hong Lu ◽  
Shudi Yang
Keyword(s):  
Secret Sharing ◽  
Linear Codes ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Secret Sharing Schemes ◽  
Regular Graphs ◽  
Authentication Codes ◽  
Strongly Regular ◽  
Weil Sums ◽  
Defining Sets

<p style='text-indent:20px;'>Linear codes with few weights are widely used in strongly regular graphs, secret sharing schemes, association schemes and authentication codes. In this paper, we construct several two-weight and three-weight linear codes over finite fields by choosing suitable different defining sets. We also give some examples and some of the codes are optimal or almost optimal. Their applications to secret sharing schemes are also investigated.</p>

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

scholarly journals Shortened Linear Codes over Finite Fields

2021 ◽  
pp. 1-1
Author(s):  
Yang Liu ◽  
Cunsheng Ding ◽  
Chunming Tang
Keyword(s):  
Finite Fields ◽  
Linear Codes

Modal Θ-valent linear codes with complementary modal Θ-valent duals

2021 ◽  
pp. 1-37
Author(s):  
Jean Armand Tsimi ◽  
Rose Christelle Youdom ◽  
Benjamin Boakye
Keyword(s):  
Linear Codes
Sign in / Sign up

Export Citation Format

Share Document