Is code equivalence easy to decide?

  title={Is code equivalence easy to decide?},
  author={Erez Petrank and Ron M. Roth},
  journal={IEEE Trans. Information Theory},
We study the computational difficulty of deciding whether two matrices generate equivalent linear codes, i.e., codes that consist of the same codewords up to a fixed permutation on the codeword coordinates. We call this problem Code Equivalence. Using techniques from the area of interactive proofs, we show on the one hand, that under the assumption that the polynomial-time hierarchy does not collapse, Code Equivalence is not NP-complete. On the other hand, we present a polynomial-time reduction… CONTINUE READING
42 Citations
14 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 14 references

On cryptosystems based on generalized Reed- Solomon codes

  • V. M. Sidelnikov, S. O. Shestakov
  • Discretnaya Math.,
  • 1992
1 Excerpt

Private coins vs . public coins in interactive proof systems , Advances in Computing Research

  • M. Sipser S. Goldwasser
  • SIAM J . Comput .
  • 1989

Private coins vs. public coins in interactive proof systems, Advances in Computing Research, S

  • S. Goldwasser, M. Sipser
  • Micali (Ed.),
  • 1989
2 Excerpts

Knapsack-type cryptosystems and algebraic coding theory, Prob

  • H. Niederreiter
  • Contr. Inform. Theory,
  • 1986
1 Excerpt

A public-key cryptosystem based on algebraic coding theory, DSN Progress Report

  • R. J. McEliece
  • 1978
1 Excerpt

Similar Papers

Loading similar papers…