1. Charpin, P., Open Problems on Cyclic Codes, Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, vol. I, ch. 11, pp. 965–1063.
2. Kaufman, T. and Litsyn, S., Almost Orthogonal Linear Codes Are Locally Testable, in Proc. 2005 46th Annu. IEEE Symp. on Foundations of Computer Science (FOCS’05), Pittsburgh, PA, USA, Oct. 23–25, 2005, pp. 317–326.
3. Kaufman, T. and Sudan, M., Algebraic Property Testing: The Role of Invariance, in Proc. 40th Annu. ACM Symp. on Theory of Computing (STOC’08), Victoria, BC, Canada, May 17–20, 2008, New York: ACM, 2008, pp. 403–412.
4. Grigorescu, E. and Kaufman, T., Explicit Low-Weight Bases for BCH Codes, IEEE Trans. Inform. Theory, 2011, vol. 58, no. 2, pp. 78–81.
5. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.