共 50 条
- [2] Equidistant Codes Meeting the Plotkin Bound are Not Optimal on the Binary Symmetric Channel [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 3015 - 3019
- [5] Optimal combinatorial batch codes based on block designs [J]. Designs, Codes and Cryptography, 2016, 78 : 409 - 424
- [6] D-optimal designs and equidistant designs for stationary processes [J]. MODA 8 - ADVANCES IN MODEL-ORIENTED DESIGN AND ANALYSIS, 2007, : 205 - 212