Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
Theoretical Computer Science
On the ring of simultaneous invariants for the Gleason-MacWilliams group
European Journal of Combinatorics - In memoriam François Jaeger
On the Covering Radius of Ternary Extremal Self-Dual Codes
Designs, Codes and Cryptography
| Hi-index | 5.23 |
In the present paper we develop a method to determine the cost weight distributions and covering radius of extremal ternary self-dual codes of various lengths. The notion of modified Jacobi polynomials is introduced and elementary aspects of it art discussed. Algebraic foundation has much room for further investigations. Since the algorithms underlining in our approach to this problem are sound, and we can bet many numerical results as far as the computer runs in a reasonable time.