Sparse Random Linear Codes are Locally Decodable and Testable

2007 ◽  
Author(s):  
Tali Kaufman ◽  
Madhu Sudan
Keyword(s):  
Linear Codes ◽  
Locally Decodable

An optimal lower bound for 2-query locally decodable linear codes

2006 ◽  
Vol 97 (6) ◽  
pp. 244-250 ◽  
Author(s):  
Dungjade Shiowattana ◽  
Satyanarayana V. Lokam
Keyword(s):  
Lower Bound ◽  
Linear Codes ◽  
Locally Decodable ◽  
Optimal Lower Bound

Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

2012 ◽  
Vol E95.A (12) ◽  
pp. 2168-2170
Author(s):  
Misako KOTANI ◽  
Shingo KAWAMOTO ◽  
Motohiko ISAKA
Keyword(s):  
Linear Codes ◽  
Binary Linear Codes ◽  
Low Dimensional

ON R-LINEAR CODES AND ITS COVERING RADIUS OF SOME CLASSES OF LINEAR CODES IN R

2020 ◽  
Vol 9 (3) ◽  
pp. 1159-1176
Author(s):  
P. Chella Pandian ◽  
J. Mahalakshmi
Keyword(s):  
Linear Codes ◽  
Covering Radius

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
Sign in / Sign up

Export Citation Format

Share Document