Author:
Arvind V.,Köbler Johannes,Kuhnert Sebastian,Torán Jacobo
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Parameterized complexity of small weight automorphisms. In: Proceedings of 34th STACS, Dagstuhl, pp. 7:1–7:13 (2017). Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2017.7
2. Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Finding small weight isomorphisms with additional constraints is fixed parameter tractable. In: Proceedings of 12 IPEC Symposium, pp. 2:1–2:13. LIPIcs 89 (2017)
3. Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757–1766 (1997). https://doi.org/10.1109/18.641542
4. Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1), 22–37 (2003). https://doi.org/10.1109/TIT.2002.806118
5. Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29(2), 545–570 (1999). https://doi.org/10.1137/S0097539797323571