On maximal antipodal spherical codes with few distances

Using linear programming techniques we derive bounds for antipodal spherical codes with few possible different distances. The possibilities for attaining our bounds are investigated and Lloyd-type theorems are proved.