臺灣博碩士論文加值系統

本篇論文主要是將里得米勒碼(Reed Muller codes)運用在資料藏匿上，以達到提高藏匿效率及降低失真度的目的，其主要的原理是利用一組相同徵狀的向量集合，並於其中找到一組最接近載體的向量碼。為了降低其解碼錯誤率並提升藏匿效能，我們利用疊代和圖形架構的方式來修改里得解碼演算法，並且，我們結合幾種不同的疊代式解碼演算法，一一比較及探討各種方式的藏匿效能，而這些方法的詳細說明與其實驗結果將在本文內容中呈現。

In our study, we use Reed Muller codes on data hiding techniques to increase the embedding efficiency and reduce the distortion of the cover. The main theory is using a set of vectors which have the same syndrome and we have to find one of them that is the closest vector with our cover. In order to reduce the errors of decoding, we use the way of iteration and factor graph form to modify Reed decoding algorithm. In addition, we exploit several methods of iteration decoding algorithm, including sum-product algorithm, min-sum algorithm. Then we compare and analyze these methods, and show the experiment result and explain in detail in this study.

Chapter 1 前言 .........1
Chapter 2 簡介 ......... 3
2.1線性區塊碼 .........3
2.2漢明權重與最小距離 ......... 4
2.3資料藏匿 ......... 6
2.4應用矩陣嵌入之資料藏匿程序 .........8
2.5里得米勒碼 .........10
2.6里得解碼演算法 .........13
Chapter 3 改良型多數決解碼演算法.........18
3.1改良型多數決解碼之和積(Sum-Product)演算法 .........19
3.2改良型多數決解碼之最小和(Min-Sum)演算法 .........28
3.3修改初始值之改良型多數決解碼演算法 .........33
3.4兩階段式改良型多數決解碼演算法.........39
3.5平手機制(No Ties)之改良型多數決解碼演算法 ......... 45
Chapter 4 模擬結果與效能分析 .........47
4.1效能比較.........47
4.2演算法之綜合比較 ......... 58
Chapter 5 結論 .........59
參考文獻......... 60

[1] C. E. Shannon, “A Mathematical Theory of Communication”, Bell Syst. Tech. J., 27: 379 - 423, July 1948.
[2] H.-A. Loeliger, “An introduction to factor graphs”, IEEE Signal Processing Magazine, vol. 21, issue 1, pp. 28-41, Jan. 2004.
[3] R. Crandall, “Some Notes on Steganography”, steganography Mailing List., 1998.
[4] K. G. Paterson and Alan E. Jones, “Efficient decoding algorithms for generalized Reed-Muller Codes”, IEEE Trans. Commun., vol. 48, no. 8, pp. 1272 - 1285, Aug. 2000.
[5] J. Fridrich, P. Lisonek, and D. Souka, “On steganographic embedding effciency”, in Proc. 8th Inf. Hiding Workshop, ser. Lecture Notes in Computer Science. Alexandria, VA: Spring, Jul. 10 - 12, 2006.
[6] F. R. Kschischang, B. J. Frey and H.-A. Loeliger, “Factor graph and the sum-product algorithm”, IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
[7] R. E. Krichevskiy, “On the number of Reed-Muller code correctable errors”, Dokl. Sov. Acad. Sci., vol. 191, pp. 541 - 547, 1970.
[8] S. N. Litsyn,“On decoding complexity of low-rate Reed-Muller codes”, in Proc. 9th All-Union Conf. Coding Theory and Information Transmission, Odessa, Ukraine, U.S.S.R., 1988, pp. 202 - 204. In Russian.
[9] C. Wang, W. Zhang, J. Liu, and N. Yu,“Fast Matrix Embedding by Matrix Extending”, IEEE Trans. Inf. Theory, vo7. 1, no. 1, pp. 346 - 350, Feb. 2012.
[10] I. S. Reed, “A class of multiple error correcting codes and the decoding scheme”, IEEE Trans. Inf. Theory, vol. IT-4, no. 4, pp. 38 - 49, Sep. 1954.
[11] F. R. Kschischang, “Codes defined on graphs”, IEEE Communications Magazine, vol. 41, issue 8, pp. 118-125, Aug. 2003.