本篇論文是利用線性區塊碼：里得米勒碼(Reed Muller codes)運用在二元資料藏匿上，其主要原理是在一組具有相同徵狀的向量集合裡找到一個最接近載體的向量碼，目的就是為了達到高藏匿效率以及低失真度。 我們將利用疊代和圖形架構的方式來修正里得解碼演算法，使之能在解碼複雜度和藏匿效能之間取得平衡。而由實驗結果發現，雖然在複雜度上略微提升，但藉此能達到提高藏匿效能的目的。 In this study, we use Linear Block Codes: Reed Muller codes for binary data hiding algorithm. The main principle is to find a vector which has the same syndrome as the select combination of collection which is the closest to the host. Finally, the purpose is to achieve high embedding efficiency and low distortion . Then we make use of iteration and factor graph to modify Reed decoding algo- rithm. It can make a balance between decoding complexity and embedding efficiency. According to the experimental results, although the complexity will increase slightly , however, the goal of increase embedding efficiency can be achieved by using the methods.