Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 754.84 |
In this correspondence it is shown how the elements of finite fields when mapped on the surface of a torus can be used for block coding over a three-dimensional signal space. The block codes are useful for data transmission using the recently defined Mannheim distance