A quick bit of MATLABing gives 4 total solutions for $k = 1$, namely $h = (-,-,+,-)$, $(-,+,+,+)$, $(+,-,-,-)$, and $(+,+,-,+)$: the corresponding values of $c$ are $2,-2,-2,2$.
My code returns no solutions for $k = 2,3$$k = 2,3,4,5$. For larger values this is prohibitive to run. To play with it (especially in case I made any stupid mistakes, as is entirely possible given the time at which I'm writing this), here it is:
function y = moq51069(K);
% for MO question 51069
n = 4*K;
w = exp(2*pi*i/n);
v = zerossparse(1,2^n); % verification array
% producefor anj array= with1:2^n
rows all possible +/-1 vectors
temp = dec2bin(0:((2^n)j-1),n);
for j h = zeros(1:2^n,n);
for k = 1:n
sh(j,k) = 2*str2num(temp(j,k))-1;
end
h = s(j,:);
h2 = [h(1),fliplr(h(2:end))]';
C = toeplitz(h2,h);
Rv = zeros(1,n);
for m = 1:n
t = w^(m-1);
tt = t.^(0:(n-1))';
Rv(m) = h*tt;
end
% test for constant integrality
c = Rv./h;
mc = max(max(abs(c - mean(c))));
if mc < 10^-6
h2 = [h(1),fliplr(h(2:end))]';
C = toeplitz(h2,h);
if det(C) == 0
'det = 0 for j = ',j
continue;
else
v(j) = c(1);h
end
end
end
y = v;