On the Optimum Distance Profiles About Linear Block Codes
暂无分享,去创建一个
[1] Henk C. A. van Tilborg,et al. On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound , 1980, Inf. Control..
[2] L. Litwin,et al. Error control coding , 2001 .
[3] Rudolf Tanner,et al. WCDMA - Requirements and Practical Design: Tanner/WCDMA , 2005 .
[4] Antti Toskala,et al. Wcdma for Umts , 2002 .
[5] Shu Lin,et al. Linear Block Codes , 1998 .
[6] Antti Toskala,et al. WCDMA for UMTS: HSPA Evolution and LTE , 2010 .
[7] David B. Jaffe. Optimal binary linear codes of length leq 30 , 2000, Discret. Math..
[8] A. J. Han Vinck,et al. The Determination of the Chain Good Weight Hierarchies with High Dimension , 2003, SIAM J. Discret. Math..
[9] David Ellis Newton,et al. Optimal ternary linear codes , 1992, Des. Codes Cryptogr..
[10] Luigi Paura. Linear block codes , 2011 .
[11] Wolfgang Willems,et al. A characterization of certain Griesmer codes: MMD codes in a more general sense , 1999, IEEE Trans. Inf. Theory.
[12] S. Baggen,et al. Coding for informed decoders , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[13] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[14] Harold N. Ward. Divisibility of Codes Meeting the Griesmer Bound , 1998, J. Comb. Theory, Ser. A.