Absolutely Sound Testing of Lifted Codes.

Electronic Colloquium on Computational Complexity (ECCC)(2015)

引用 4|浏览73
暂无评分
摘要
In this work we present a strong analysis of the testability of a broad, and to date the most interesting known, class of “affine-invariant” codes. Affine-invariant codes are codes whose coordinates are associated with a vector space and are invariant under affine transformations of the coordinate space. Affine-invariant linear codes form a natural abstraction of algebraic properties such as linearity and low-degree, which have been of significant interest in theoretical computer science in the past. The study of affine-invariance is motivated in part by its relationship to property testing: Affine-invariant linear codes tend to be locally testable under fairly minimal and almost necessary conditions.
更多
查看译文
关键词
IEEE Computer Society, Linear Code, Block Length, LDPC Code, Base Code
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要