Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound
IEEE Trans. Information Theory, Volume 64, Issue 8, 2018, Pages 5813-5831.
EI
Abstract:
One of the most important open problems in the theory of error-correcting codes is to determine the tradeoff between the rate R and minimum distance δ of a binary code. The best known tradeoff is the Gilbert-Varshamov bound, and says that for every δ ∈ (0, 1/2), there are codes with minimum distance δ and rate R = RGV (δ) > 0 (for a certa...More
Code:
Data:
Get fulltext within 24h
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 280 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1200 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 3000 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 7000 coins
Wechat's Red Packet
Tags
Comments