Using CSP to model the synchronisation process of variable length codes
暂无分享,去创建一个
[1] M. Wada,et al. Reversible variable length codes , 1995, IEEE Trans. Commun..
[2] A.C.M. Fong,et al. Analysis of the decoding process of T-codes , 2002 .
[3] Ya-Qin Zhang,et al. Transporting real-time video over the Internet: challenges and approaches , 2000, Proceedings of the IEEE.
[4] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[5] A.C.M. Fong,et al. Error localization for robust video transmission , 2002, IEEE Trans. Consumer Electron..
[6] John P. Robinson,et al. Error recovery for variable length codes , 1985, IEEE Trans. Inf. Theory.
[7] Andrew William Roscoe,et al. The Theory and Practice of Concurrency , 1997 .
[8] Yao Wang,et al. Error control and concealment for video communication: a review , 1998, Proc. IEEE.
[9] A.C.M. Fong,et al. Using a tree algorithm to determine the average synchronisation delay of self-synchronising T-codes , 2002 .
[10] Mark R. Titchener. The synchronization of variable-length codes , 1997, IEEE Trans. Inf. Theory.
[11] M. R. Titchener,et al. Calculating the expected synchronisation delay for T-code sets , 1997 .
[12] Yasuhiro Takishima,et al. Error states and synchronization recovery for variable length codes , 1994, IEEE Trans. Commun..
[13] Thomas J. Ferguson,et al. Self-synchronizing Huffman codes , 1984, IEEE Trans. Inf. Theory.
[14] Bernd Girod. Bidirectionally decodable streams of prefix code-words , 1999, IEEE Communications Letters.
[15] M. R. Titchener,et al. Generalised T-codes : extended construction algorithm for self-synchronising codes , 1996 .