A. Artom
Abstract
In this correspondence a special prefix code with stuffing bits is described and the sequences that are more suitable as prefixes, called valid sequences, are determined by means of a condition they must satisfy. The best prefix length as a function of the total number of bits in the code is then evaluated.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this correspondence a special prefix code with stuffing bits is described and the sequences that are more suitable as prefixes, called valid sequences, are determined by means of a condition they must satisfy. The best prefix length as a function of the total number of bits in the code is then evaluated.
Key concepts: Prefix code, Prefix, Synchronizing, Code (set theory), Universal code, Computer science, Function (biology), Arithmetic