Author:
Kaufman Tali,Litsyn Simon
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Augot, D., Charpin, P., Sendrier, N.: Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inform. Theory 38(3), 960–973 (1992)
2. Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)
3. Cohen, G., Litsyn, S., Zémor, G.: On the traveling salesman problem in binary Hamming spaces. IEEE Trans. Inform. Theory 42(4), 1274–1276 (1996)
4. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)
5. Cohen, S.D.: The length of primitive BCH codes with minimal covering radius. Designs, Codes, and Cryptography 10(1), 5–16 (1997)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Succinct Representation of Codes with Applications to Testing;SIAM Journal on Discrete Mathematics;2012-01
2. Succinct Representation of Codes with Applications to Testing;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2009