On Zero-Error Capacity of Graphs with One Edge
<|reference_start|>On Zero-Error Capacity of Graphs with One Edge: In this paper, we study the zero-error capacity of channels with memory, which are represented by graphs. We provide a method to construct code for any graph with one edge, thereby determining a lower bound on its zero-error capacity. Moreover, this code can achieve zero-error capacity when the symbols in a vertex with degree one are the same. We further apply our method to the one-edge graphs representing the binary channels with two memories. There are 28 possible graphs, which can be organized into 11 categories based on their symmetries. The code constructed by our method is proved to achieve the zero-error capacity for all these graphs except for the two graphs in Case 11.<|reference_end|>
@article{cao2024on,
    title={On Zero-Error Capacity of Graphs with One Edge},
    author={Qi Cao, Qi Chen, Baoming Bai},
    journal={arXiv preprint arXiv:2406.17223},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17223},
    primaryClass={cs.IT math.IT}
}