Information Source Coding Combined with Frame Synchronization

1. 基于分布式标记的前缀同步码编解码算法推导前缀同步码是一组固定长度的码字，每个码字由一个公共标记和一个传递输入信息的约束序列串联而成。约束序列满足这样的条件，即该标记仅出现在相应码字的开头。因此，通过找到标记的位置，我们可以很容易地恢复一个码字序列的同步，即使可能发生滑动页错误。本文提出了一种新的具有分布式标记的前缀同步码，其中的符号不一定是连续的。在相同码字长度的情况下，与传统的字冠同步码相比，所提出的部分字冠同步码可以提高编码速率。基于枚举编码，推导了PPS码的编解码算法。分布式标记的构造在给定一定数量的位的情况下，得到了分布式标记的最大长度，并给出了一种构造最大分布式标记的方法。符号插入/删除错误纠正前缀同步码前缀能够纠正两个符号插入/删除错误的同步码，所提出的代码可以恢复帧同步和纠正符号插入/删除错误，如果滑页错误和符号错误不同时发生。

1. Derivation of Encoding and Decoding Algorithms on Prefix Synchronized Codes with Distributed MarkersPrefix synchronized code is a set of codewords of a fixed length, each of which is given by concatinating a common marker and a constrained sequence conveying input information. A constrained sequence satisfies the condition such that the marker appears only at the beginning of the corresponding codeword. Therefore, by finding the marker's position we can easily recover the synchronization of a sequence of codewords even if a slip page error might occur.In this research we introduced a new class of prefix synchronized codes having distributed marker in which symbols are not necessarily consecutive to each other. The proposed Partial Prefix Synchronized (PPS) codes can increase coding rate comparing with traditional prefix synchronized codes of the same codeword length. We derived encoding and decoding algorithms of PPS codes based on enumerative coding.2. Construction of Distributed MarkerWe obtained the maximum length of distributed markers given a number of bits having fixed valued in the marker and give a method to construct the maximum dsitributed markers.3. Symbol Insertion/Deletion Error Correcting Prefix Synchronized CodesPrefix Synchronized codes capable of correcting two symbol insertion/deletion errors are derived, The proposed codes can recover frame syncrhonization and correct symbol ins/del errors if slip page error and symbol errors do not occur simultaneously.