Remarks on Johnson-type Bounds for Insdel Codes
arXiv:2605.2509010.1
Predicted impact top 34% in IT · last 90 daysOriginality Synthesis-oriented
AI Analysis
Provides a tighter theoretical bound for list-decoding of insertion-deletion codes, which is of interest to coding theorists.
The paper refines the Johnson-type list-size bound for insertion-deletion codes by encoding local lists into binary constant-weight codes, improving the bound for certain parameters.
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.