Asymptotically good homological error correcting codes

Let $\Delta$ be an abstract simplicial complex. We study classical homological error correcting codes associated to $\Delta$, which generalize the cycle codes of simple graphs. It is well-known that cycle codes of graphs do not yield asymptotically good families of codes. We show that asymptotically...

Full description

Bibliographic Details
Main Authors: Jason McCullough, Heather Newman
Format: Article
Language:English
Published: Yildiz Technical University 2019-09-01
Series:Journal of Algebra Combinatorics Discrete Structures and Applications
Online Access:http://jm.jacodesmath.com/index.php/jacodesmath/article/view/186
id doaj-c418cfb949744f798133c96d2af08683
record_format Article
spelling doaj-c418cfb949744f798133c96d2af086832020-11-25T00:18:41ZengYildiz Technical UniversityJournal of Algebra Combinatorics Discrete Structures and Applications2148-838X2019-09-0163123Asymptotically good homological error correcting codesJason McCullough0Heather NewmanIowa State UniversityLet $\Delta$ be an abstract simplicial complex. We study classical homological error correcting codes associated to $\Delta$, which generalize the cycle codes of simple graphs. It is well-known that cycle codes of graphs do not yield asymptotically good families of codes. We show that asymptotically good families of codes do exist for homological codes associated to simplicial complexes of dimension at least $2$. We also prove general bounds and formulas for (co-)cycle and (co-)boundary codes for arbitrary simplicial complexes over arbitrary fields.http://jm.jacodesmath.com/index.php/jacodesmath/article/view/186
collection DOAJ
language English
format Article
sources DOAJ
author Jason McCullough
Heather Newman
spellingShingle Jason McCullough
Heather Newman
Asymptotically good homological error correcting codes
Journal of Algebra Combinatorics Discrete Structures and Applications
author_facet Jason McCullough
Heather Newman
author_sort Jason McCullough
title Asymptotically good homological error correcting codes
title_short Asymptotically good homological error correcting codes
title_full Asymptotically good homological error correcting codes
title_fullStr Asymptotically good homological error correcting codes
title_full_unstemmed Asymptotically good homological error correcting codes
title_sort asymptotically good homological error correcting codes
publisher Yildiz Technical University
series Journal of Algebra Combinatorics Discrete Structures and Applications
issn 2148-838X
publishDate 2019-09-01
description Let $\Delta$ be an abstract simplicial complex. We study classical homological error correcting codes associated to $\Delta$, which generalize the cycle codes of simple graphs. It is well-known that cycle codes of graphs do not yield asymptotically good families of codes. We show that asymptotically good families of codes do exist for homological codes associated to simplicial complexes of dimension at least $2$. We also prove general bounds and formulas for (co-)cycle and (co-)boundary codes for arbitrary simplicial complexes over arbitrary fields.
url http://jm.jacodesmath.com/index.php/jacodesmath/article/view/186
work_keys_str_mv AT jasonmccullough asymptoticallygoodhomologicalerrorcorrectingcodes
AT heathernewman asymptoticallygoodhomologicalerrorcorrectingcodes
_version_ 1725375225368936448