Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.07916 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912729167560704 |
|---|---|
| author | Cheraghchi, Mahdi Shagrithaya, Nikhil Veliche, Alexandra |
| author_facet | Cheraghchi, Mahdi Shagrithaya, Nikhil Veliche, Alexandra |
| contents | In this paper we present two reductions between variants of the Code Equivalence problem. We give polynomial-time Karp reductions from Permutation Code Equivalence (PCE) to both Linear Code Equivalence (LCE) and Signed Permutation Code Equivalence (SPCE). Along with a Karp reduction from SPCE to the Lattice Isomorphism Problem (LIP) proved in a paper by Bennett and Win (2024), our second result implies a reduction from PCE to LIP. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_07916 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reductions Between Code Equivalence Problems Cheraghchi, Mahdi Shagrithaya, Nikhil Veliche, Alexandra Computational Complexity In this paper we present two reductions between variants of the Code Equivalence problem. We give polynomial-time Karp reductions from Permutation Code Equivalence (PCE) to both Linear Code Equivalence (LCE) and Signed Permutation Code Equivalence (SPCE). Along with a Karp reduction from SPCE to the Lattice Isomorphism Problem (LIP) proved in a paper by Bennett and Win (2024), our second result implies a reduction from PCE to LIP. |
| title | Reductions Between Code Equivalence Problems |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2502.07916 |