Title :
Quasi-linear synchronization codes
Author :
van Wijngaarden, A.J.
Author_Institution :
Inst. for Exp. Math., Essen, Germany
Abstract :
The use of quasi-linear synchronization (QLS) codes to provide synchronization of frames with fixed length n offers many advantages relative to comma-free codes and prefix synchronized codes. Easy frame location and the absence of data conversion enable a QLS-code to be implemented with very low complexity independent of the frame length. Another important aspect is the ability of error control in the presence of substitution errors. A list of optimal QLS-codes of length up to 40 obtained with elaborate computer search is presented. Several families of perfect and (sub) optimal QLS-codes with large word length n have been constructed, and also new upper bounds on the redundancy of the codes have been established
Keywords :
binary sequences; combinatorial mathematics; error correction; linear codes; search problems; synchronisation; binary codes; code redundancy; combinatorial methods; comma-free codes; computer search; error control code; fixed length frames; frame location; frame synchronization; low complexity code; optimal QLS-codes; prefix synchronized codes; quasilinear synchronization codes; suboptimal QLS-codes; upper bounds; Decoding; Encoding; Error correction; Error correction codes; Hamming distance; Linear code; Mathematics; Redundancy; Upper bound;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550450
