Pseudo-ternary run-length limited spectrum shaped codes
暂无分享,去创建一个
[1] Thomas M. Cover,et al. Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.
[2] A. Croisier. Introduction to pseudoternary transmission codes , 1970 .
[3] E. Gorog,et al. Redundant alphabets with desirable frequency spectrum properties , 1968 .
[4] Tetsunao Matsuta,et al. 国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .
[5] Ivan J. Fair,et al. Construction and characteristics of codewords and pulse shapes that satisfy spectral constraints , 2008, IEEE Transactions on Communications.
[6] Oleg F. Kurmaev,et al. Constant-Weight and Constant-Charge Binary Run-Length Limited Codes , 2009, IEEE Transactions on Information Theory.
[7] James A. McHugh,et al. Algorithmic Graph Theory , 1986 .
[8] M. Lin,et al. On soft iterative decoding for ternary recording systems with RLL constraints , 2010, 2010 International Symposium On Information Theory & Its Applications.
[9] C. A. French,et al. Results involving (D,K) constrained M-ary codes , 1987 .
[10] Kees A. Schouhamer Immink,et al. An enumerative coding technique for DC-free runlength-limited sequences , 2000, IEEE Trans. Commun..
[11] Paul H. Siegel,et al. Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.