RM TANNER's scientific contributions

Publication (1)

Article
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is shown which specifies carefully chosen subsets of the digits of the new codes that must be codewords in one of the shorter subcodes. Lower bounds to the rate and the minimum d...

Citations

... Unique-neighbor expanders have several applications in theoretical computer science. In coding theory, it was shown in [DSW06,BV09] that unique-neighbor expander codes [Tan81] are "weakly smooth", hence when tensored with a code with constant relative distance, they give robustly testable codes. In high-dimensional geometry, unique-neighbor expanders were used in [GLR10,Kar11] to construct p -spread subspaces as well as in [BGI + 08, GMM22] to construct matrices with the p -restricted isometry property (RIP). ...