arXiv (All)
open access
Recursively Extended Permutation Codes under Chebyshev Distance
We study recursively extended permutation (REP) codes under the Chebyshev distance. An REP code is built by repeatedly inserting an allowed symbol in the first coordinate and relabeling the remaining symbols. The central question is how large such a code can be for a prescribed length and minimum di
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Decoding rank metric Reed-Muller codes#153696
- Nonnesting permutations avoiding 123#973323
- Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance#1117849
- Codes in the Sum-Rank Metric and Codes over Rings / Cornelia Ott#1052404
- On the Hamming distance properties of group codes#490073
Record · ID 972892
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive