Remarks on Johnson-type Bounds for Insdel Codes

May 24, 2026 · Grace Period · + Add venue

⏳ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Yulin Yang arXiv ID 2605.25090 Category cs.IT: Information Theory Citations 0
Abstract
We refine the Johnson-type list-size bound of Hayashi and Yasunaga for insertion-deletion codes by encoding local lists into binary constant-weight codes.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Information Theory