  Strongly walk-regular graphs can be constructed as coset graphs of the duals
of projective three-weight codes whose weights satisfy a certain equation. We
provide classifications of the feasible parameters in the binary and ternary
case for medium size code lengths. Additionally some theoretical insights on
the properties of the feasible parameters are presented.
