For channels that introduce substitution, insertion and deletion errors, one challenging problem for a code designer is to avoid false code synchronization. In other words, the probability of false codewords occurring should be minimized with appropriate code design. In this paper, we propose a new class of systematic comma free code called generalized F(n, s, t) code. We first prove that this code is a synchronous code and then we derive the probabilities of false synchronization when a substitution, insertion or deletion error occur. We compare the theoretical and simulation results under different parameters. We also compare the performance of our proposed code with the classical F code.
|Title of host publication
|2017 23rd Asia-Pacific Conference on Communications
|Subtitle of host publication
|Bridging the Metropolitan and the Remote, APCC 2017
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - 11 Dec 2017
|23rd Asia-Pacific Conference on Communications, APCC 2017 - Perth, Australia
Duration: 11 Dec 2017 → 13 Dec 2017
|2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017
|23rd Asia-Pacific Conference on Communications, APCC 2017
|11/12/17 → 13/12/17
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing