%N Largest d such that the linear programming bound for quantum codes of length n is feasible for some real K>1.
%C Bounded above by floor((n+1)/6)+floor((n+2)/6)+1 for all n, with equality when n < 100. For n < 22 and 25 <= n <= 30 this bound is attained by actual additive quantum codes; for other values of n, this is unknown.
%D E. M. Rains, Shadow bounds for self-dual codes, IEEE Trans. Inform. Theory, 44 (No. 1, 1998), 134-139.
%D E. M. Rains, Monotonicity of the quantum linear programming bound, IEEE Trans. Inform. Theory, 45 (No. 7, 1999), 2489-2491.
%A Eric M. Rains (rains(AT)caltech.edu), Dec 02 2000