Sciweavers

7 search results - page 2 / 2
» Symmetric LDPC codes are not necessarily locally testable
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
13 years 12 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
TCOM
2010
111views more  TCOM 2010»
13 years 3 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...