On a Family of Codes with Bounded Deciphering Delay
A special kind of codes with bounded deciphering delay, called k-comma-free codes, is considered. The advantage in using these codes is that the decoding can begin “anywhere” in a coded message. This means that a coded message can be deciphered even when it might be lost partially. Related families of codes with bounded deciphering delay are also considered. Criteria to test these codes are established in a unified way.
KeywordsSpecial Kind Related Family Small Integer Regular Language Original Message
Unable to display preview. Download preview PDF.
- 6.Sardinas A. A., Patterson C. W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104–108.Google Scholar