Author:
Biswas Bhaskar,Sendrier Nicolas
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Barg, A.: Complexity issues in coding theory. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding theory, ch. 7, vol. I, pp. 649–754. North-Holland, Amsterdam (1998)
2. Lecture Notes in Computer Science;M. Bellare,1995
3. Berlekamp, E.R.: Factoring polynomials over large finite fields. Mathematics of Computation 24(111), 713–715 (1970)
4. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3) (May 1978)
5. Lecture Notes in Computer Science;T. Berson,1997
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献