We construct strongly walk-regular graphs as coset graphs of the duals of three-weight codes over F q. The columns of the check matrix of the code form a triple sum set, a natural generalization of partial difference sets. Many infinite families of such graphs are constructed from cyclic codes, Boolean functions, and trace codes over fields and rings. Classification in short code lengths is made for q = 2, 3, 4.