DocumentCode :
1416124
Title :
Optimal permutation codes for the Gaussian channel
Author :
Karlof, John K. ; Chang, Yaw O.
Author_Institution :
Dept. of Math. Sci., North Carolina Univ., Wilmington, NC, USA
Volume :
43
Issue :
1
fYear :
1997
fDate :
1/1/1997 12:00:00 AM
Firstpage :
356
Lastpage :
358
Abstract :
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
Keywords :
Gaussian channels; channel coding; nonlinear programming; Gaussian channel; geometric programming; minimum distance; nonlinear programming algorithm; optimal permutation codes; primitive permutation groups; Closed-form solution; Gaussian channels; Mathematical programming; Research and development; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.567763
Filename :
567763
Link To Document :
بازگشت