...
首页> 外文期刊>Combinatorica >Tight lower bounds for linear 2-query LCCs over finite fields
【24h】

Tight lower bounds for linear 2-query LCCs over finite fields

机译:有限域上线性2查询LCC的紧下界

获取原文
获取原文并翻译 | 示例
           

摘要

A Locally Correctable Code (LCC) is an error correcting code that has a probabilistic self-correcting algorithm that, with high probability, can correct any coordinate of the codeword by looking at only a few other coordinates, even if a delta fraction of the coordinates is corrupted. LCCs are a stronger form of LDCs (Locally Decodable Codes) which have received a lot of attention recently due to their many applications and surprising constructions.
机译:本地可纠正代码(LCC)是一种纠错代码,它具有概率自纠正算法,该算法很可能仅通过查看其他几个坐标就可以纠正码字的任何坐标,即使坐标的增量分数很小已损坏。 LCC是更强大的LDC(本地可解码代码)形式,由于它们的许多应用和令人惊讶的构造,最近引起了很多关注。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号