Year: 2026
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Carruth, Nathan Thomas
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7140168041