최소거리가 확장된 극 부호의 연속 제거 리스트 복호 성능
暂无分享,去创建一个
[1] Michael Gastpar,et al. On LP decoding of polar codes , 2010, 2010 IEEE Information Theory Workshop.
[2] Gérard D. Cohen,et al. On the covering radius of Reed-Muller codes , 1992, Discret. Math..
[3] E. Arkan,et al. A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.
[4] Ryuhei Mori,et al. Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.
[5] Emre Telatar,et al. Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.
[6] Alexander Vardy,et al. How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.
[7] 허수정,et al. 지구 자기장 기반의 Fingerprint 실내 위치추정 방법 연구 , 2013 .
[8] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[9] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[10] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[11] Johannes B. Huber,et al. Improving successive cancellation decoding of polar codes by usage of inner block codes , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.
[12] Eren Sasoglu. Polar codes for discrete alphabets , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[13] Rüdiger L. Urbanke,et al. Polar Codes for Channel and Source Coding , 2009, ArXiv.
[14] Toshiyuki Tanaka,et al. Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.