Geometric programming for communication systems
Communications and Information Theory
International Journal of Modelling and Simulation
Hi-index | 754.84 |
This correspondence contains a continuation of the table contained in Karlof (1989) listing the minimum distance of optimal permutation codes generated by primitive permutation groups of degree less than or equal to 20. We use a nonlinear programming algorithm developed using geometric programming techniques