Error-detecting solid codes
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914412144623616 |
|---|---|
| author | Carruth, Nathan Thomas |
| author_facet | Carruth, Nathan Thomas |
| contents | A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may differ in length, have been studied by various authors. In this short note, we observe that a recent construction of variable-length solid codes based on binary codes may be extended to arbitrary n-ary codes. We further prove an interesting error-detection property of a specific subfamily of these variable-length solid codes, and give a concrete application to a certain type of binary code. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_20298 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Error-detecting solid codes Carruth, Nathan Thomas Information Theory Combinatorics A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may differ in length, have been studied by various authors. In this short note, we observe that a recent construction of variable-length solid codes based on binary codes may be extended to arbitrary n-ary codes. We further prove an interesting error-detection property of a specific subfamily of these variable-length solid codes, and give a concrete application to a certain type of binary code. |
| title | Error-detecting solid codes |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2603.20298 |