1. [1] Goethals, J. M. and Delsarte, P. (1967). On a class of majority logic decodable cyclic codes, presented at the San Remo International Symposium on Information Theory, September, 1967.
2. [2] Graham, R. L. and MacWilliams, J. (1966). On the number of information symbols in differenceset cyclic codes. Bell System Technical Journal 45 1057-1070.
3. [3] Massey, J. C. (1963). Threshold decoding. The M. I. T. Press, Cambridge, Massachusetts.
4. [4] Rudolph, L. D. (1967). A class of majority logic decodable codes. IEEE Transactions on Information Theory IA 3 305-307.
5. [5] Smith, K. J. C. (1967). Majority decodable codes derived from finite geometries. Inst. Statist, mimeo. series 561, Chapel Hill, N. C.