Applications of Decompositions of Edge-Colored Digraphs to the Construction of Optimal Codes
暂无分享,去创建一个
Y. M. Chee | Y. Chee | Xiande Zhang | A. Ling | H. M. Kiah | Fei Gao | Hui Zhang | Fei Gao
[1] Y. Chee,et al. Hanani triple packings and optimal $$q$$q-ary codes of constant weight three , 2015, Des. Codes Cryptogr..
[2] Sylvain Guilley,et al. Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions , 2014, IEEE Transactions on Information Theory.
[3] Charles J. Colbourn,et al. Covering and packing for pairs , 2013, J. Comb. Theory, Ser. A.
[4] Hui Zhang,et al. Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five , 2013, IEEE Transactions on Information Theory.
[5] Hui Zhang,et al. Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5 , 2012, IEEE Transactions on Information Theory.
[6] Yeow Meng Chee,et al. Estimates on the Size of Symbol Weight Codes , 2011, IEEE Transactions on Information Theory.
[7] Yeow Meng Chee,et al. Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes , 2010, IEEE Transactions on Information Theory.
[8] Hui Zhang,et al. Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six , 2010, IEEE Transactions on Information Theory.
[9] Gennian Ge,et al. Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three , 2008, IEEE Transactions on Information Theory.
[10] Yeow Meng Chee,et al. The Sizes of Optimal $q$ -Ary Codes of Weight Three and Distance Four: A Complete Solution , 2008, IEEE Transactions on Information Theory.
[11] Yeow Meng Chee,et al. Constructions for $q$-Ary Constant-Weight Codes , 2007, IEEE Transactions on Information Theory.
[12] Daniel J. Costello,et al. Channel coding: The road to channel capacity , 2006, Proceedings of the IEEE.
[13] Charles J. Colbourn,et al. On constant composition codes , 2006, Discret. Appl. Math..
[14] Charles J. Colbourn,et al. Constructions for Permutation Codes in Powerline Communications , 2004, Des. Codes Cryptogr..
[15] M. Svanstrom. Constructions of ternary constant-composition codes with weight three , 2000 .
[16] Richard M. Wilson,et al. Decompositions of Edge-Colored Complete Graphs , 2000, J. Comb. Theory, Ser. A.
[17] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[18] Richard M. Wilson,et al. An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms , 1972, J. Comb. Theory, Ser. A.
[19] Richard M. Wilson,et al. An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory, Ser. A.
[20] Patric R. J. Östergård,et al. Bounds and constructions for ternary constant-composition codes , 2002, IEEE Trans. Inf. Theory.
[21] Sven Hartmann,et al. Superpure digraph designs , 2002 .
[22] A. J. Han Vinck,et al. On the Constructions of Constant-Weight Codes , 1998, IEEE Trans. Inf. Theory.
[23] Richard M. Wilson,et al. An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.