Article contents
Lee Polynomials of Codes and Theta Functions of Lattices
Published online by Cambridge University Press: 20 November 2018
Extract
Several authors [2; 3; 10; 12] have noticed the similarities between the theory of codes and the theory of Euclidean lattices. It is interesting to compare the two theories since they share a common problem, viz. the sphere packing problem. In the theory of codes one would like to find a code over Fp, i.e. a subspace of Fpn, such that non-intersecting spheres with respect to a given metric, centered at the code vectors, pack Fpn densely.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1978
References
- 2
- Cited by