This paper presents an analysis of the pair-wise error rates and average bit-error rates (BER) of orthogonal dirty-paper codes. The error rate expressions are derived and also verified by simulations. It is also found that, when applied in watermarking systems, the optimum code length of such orthogonal dirty-paper codes is a function of the data hiding rate and the document-to-watermark ratio.
Citation:
Xiaotian Xu, Yong Liang Guan, Kah Chan Teh, "Analysis of Error Probability of Orthogonal Dirty-Paper Codes in Watermarking Applications," icicic, vol. 3, pp.42-45, First International Conference on Innovative Computing, Information and Control - Volume III (ICICIC'06), 2006