A generalized systematic comma free code

Tianbo Xue, Francis C.M. Lau

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2017 23rd Asia-Pacific Conference on Communications
Subtitle of host publicationBridging the Metropolitan and the Remote, APCC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
ISBN (Electronic)9781740523905
DOIs
Publication statusPublished - 11 Dec 2017
Event23rd Asia-Pacific Conference on Communications, APCC 2017 - Perth, Australia
Duration: 11 Dec 201713 Dec 2017

Publication series

Name2017 23rd Asia-Pacific Conference on Communications: Bridging the Metropolitan and the Remote, APCC 2017
Volume2018-January

Conference

Conference23rd Asia-Pacific Conference on Communications, APCC 2017
CountryAustralia
CityPerth
Period11/12/1713/12/17

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this