High-Rate Self-Synchronizing Codes

DOI10.1109/TIT.2012.2234501zbMATH Open1364.94740arXiv1208.5216OpenAlexW3100840595MaRDI QIDQ2989320FDOQ2989320

Authors: Yuichiro Fujiwara, Vladimir D. Tonchev 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the positions of synchronization markers in codewords in such a way that the resulting error-tolerant self-synchronizing codes may be realized as cosets of linear codes. Ideally, difference systems of sets should sacrifice as few bits as possible for a given code length, alphabet size, and error-tolerance capability. However, it seems difficult to attain optimality with respect to known bounds when the noise level is relatively low. In fact, the majority of known optimal difference systems of sets are for exceptionally noisy channels, requiring a substantial amount of bits for synchronization. To address this problem, we present constructions for difference systems of sets that allow for higher information rates while sacrificing optimality to only a small extent. Our constructions utilize optimal difference systems of sets as ingredients and, when applied carefully, generate asymptotically optimal ones with higher information rates. We also give direct constructions for optimal difference systems of sets with high information rates and error-tolerance that generate binary and ternary self-synchronizing codes.

Full work available at URL: https://arxiv.org/abs/1208.5216

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Synchronization error-correcting codes (94B50)

Cited In (11)

• Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
• Disjoint difference families and their applications
• Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
• Decomposing complete graphs into isomorphic complete multipartite graphs
• A note on difference families from cyclotomy
• Difference systems of sets with size 2
• On optimal weak algebraic manipulation detection codes and weighted external difference families
• External Difference Families from Finite Fields
• Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
• Two new families of quantum synchronizable codes

This page was built for publication: High-Rate Self-Synchronizing Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989320)