我們主要是在做迴旋碼的碼搜尋, 我們從一個碼的角度來看已經做到全面性碼搜尋, 但是從一個編碼器來看, 並沒有做到全面性碼搜尋, 因為一個碼之下, 編碼器有很多種, 我們的最小籬柵模組是使用特定情況下的生成矩陣, 因此並不會考慮到全部的編碼器. 迴旋碼的最小籬柵模組架構可以觀察出等效碼現象, 但是迴旋碼傳統的籬柵架構沒辦法觀察出等效碼現象. 等效碼會造成兩個不同的碼, 它們的權重頻譜會相等, 因此在做碼搜尋時, 如果不考慮等效碼的話, 會造成搜尋出來的結果, 會有很多碼的權重頻譜會相等, 這樣很浪費時間, 因為我們為了做到全面性碼搜尋並且不考慮等效碼的情況, 會浪費掉很多時間, 如果考慮了等效碼現象, 我們可以花更少的時間去找到最好的碼.
最小籬柵模組架構跟傳統籬柵架構相比, 最小離柵模組的籬柵複雜度比傳統的籬柵架構還要低.
我們提出一個方法去做碼搜尋. 碼搜尋是為了找出(n,k)二元迴旋碼. 我們所提出的方法是用排列組合的觀念去達成, 並且在做碼搜尋時會考慮等效碼現象. 我們會提供搜尋的結果和一些有做碼搜尋的文獻做權重頻譜的比較, 在相同的編碼率和記憶大小情況下.

R. J. McEliece and W. Lin, “The trellis complexity of convolutional codes,”IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1855-1864, Nov. 1996.

J.K.Wolf, “Efficient maximum-likelihood decoding of linear block codes using trellis,”IEEE Trans. Inf. Theory, IT-24: 76-80, 1978.

G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inf. Theory, vol. 34, pp. 1152–1187, Sep. 1988.

D. J. Muder, “Minimal trellises for block codes,” IEEE Trans. Inf. Theory, vol. 34, pp. 1049–1053, Sep. 1988.

V. Sidorenko and V. Zyablov, “Decoding of convolutional codes using a syndrome trellis,” IEEE Trans. Inf. Theory, vol. 40, no. 5, pp. 1663–1666, Sep. 1994.

H.-H. Tang and M.-C. Lin, “On (n, n-1) convolutional codes with low trellis complexity, IEEE Trans. Commun., vol. 50, no. 1, pp. 37-47,Jan. 2002.

H.-H. Tang and M.-C. Lin, “Minimal trellis modules and equivalent convolutional codes,” IEEE Trans. Commun., vol. 52, no. 8, pp. 3738-3746, August. 2006.

J. B. Cain, G. C. Clark Jr, and J. M. Geist, “Punctured convolutional codes of rate (n, n-1) and simplified maximum likelihood decoding,” IEEE Trans. Inf. Theory, vol. 25, pp. 97–100, Jan. 1979.

G. Bégin and D. Haccoun, “High rate punctured convolutional codes: Structure properties and construction technique,” IEEE Trans. Commun, vol. 37, pp. 1381–1385, Dec. 1989.

I. E. Bocharova and B. D. Kudryashov, “Rational rate punctured convolutional codes for soft-decision Viterbi decoding,” IEEE Trans. Inform. Theory, vol. 43, pp. 1305–1313, July 1997.

R. J. McEliece, “On the BCJR trellis for linear block codes,” IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1072–1092, Jul. 1996.

G. D. Forney Jr, “Dimension/length profiles and trellis complexity of linear block codes,” IEEE Trans. Inf. Theory, vol. 40, pp.1741–1752, Nov. 1994.

A. Viterbi, “Convolutional codes and their performance in communicationsystems,” IEEE Trans. Commun., vol. COM-19, no. 5, pp.751–772, Oct. 1971.

Alexandros Katsiotis, Panagiotis Rizomiliotis, and Nicholas Kalouptsidis “New constructions of high-performance low-complexity convolutional codes” IEEE Trans. Commun, vol. 58, no. 7, pp. 1950-1961 July 2010

Bartolomeu F. Ucha-Filho, Richard Demo Souza, Cecilio Pimentel and Marcel Jar, “Further results on convolutional codes based on a minimal trellis complexity measure,” Telecommunications Symposium, pp. 123–128, Sept 2006.