"Permutation Code Equivalence is Not Harder Than Graph Isomorphism When ..."

Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha (2019)

> Home

Details and statistics

DOI: 10.1109/ISIT.2019.8849855

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/BardetOS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/BardetOS19
Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha:
Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. ISIT 2019: 2464-2468

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.