A Survey on Codes from Simplicial Complexes
<|reference_start|>A Survey on Codes from Simplicial Complexes: In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning that every subset of a set within the family is also included in the family. The purpose of this paper is two-fold. Firstly, it aims to present a comprehensive survey of recent results in the field. This survey intends to provide an overview of the advancements made in codes constructed from simplicial complexes. Secondly, the paper seeks to propose open problems that are anticipated to stimulate further research in this area. By highlighting these open problems, the paper aims to encourage and inspire future investigations and developments in the field of codes derived from simplicial complexes.<|reference_end|>
@article{wu2024a,
    title={A Survey on Codes from Simplicial Complexes},
    author={Yansheng Wu, Chao Li, Jong Yoon Hyun},
    journal={arXiv preprint arXiv:2409.16310},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.16310},
    primaryClass={cs.IT math.CO math.IT}
}