2011/08/14 by Ethan Fetaya, Fetaya, Ethan · 2 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Coding theory and cryptography #Computational Geometry (cs.CG) #Differential Geometry (math.DG) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.CG #cs.IT #math.DG #math.IT
paper · pdf · doi:10.48550/arxiv.1108.2886
arxiv created 2011/08/14 · openalex publication_date 2011/08/14 · arxiv updated 2011/08/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In my masters thesis I prove a square root bound on the distance of homological codes that come from two dimensional surfaces, as a result of the systolic inequality. I also give a detailed version of M.H. Freedman's proof that due to systolic freedom, this bound does not hold in higher dimensions.