Methods for relativizing properties of codes
The usual setting for information transmission systems assumes that all words over the source alphabet need to be encoded. The demands on encodings of messages with respect to decodability, error-detection, etc. are thus relative to the whole set of words. In reality, depending on the information so...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2015
|
| Series: | Acta cybernetica
22 No. 2 |
| Kulcsszavak: | Kódolás - számítástechnika |
| Subjects: | |
| doi: | 10.14232/actacyb.22.2.2015.3 |
| Online Access: | http://acta.bibl.u-szeged.hu/36115 |
| Summary: | The usual setting for information transmission systems assumes that all words over the source alphabet need to be encoded. The demands on encodings of messages with respect to decodability, error-detection, etc. are thus relative to the whole set of words. In reality, depending on the information source, far fewer messages are transmitted, all belonging to some specific language. Hence the original demands on encodings can be weakened, if only the words in that language are to be considered. This leads one to relativize the properties of encodings or codes to the language at hand. We analyse methods of relativization in this sense. It seems there are four equally convincing notions of relativization. We compare those. Each of them has their own merits for specific code properties. We clarify the differences between the four approaches. We also consider the decidability of relativized properties. If P is a property defining a class of codes and L is a language, one asks, for a given language C, whether C satisfies P relative to L. We show that in the realm of regular languages this question is mostly decidable. |
|---|---|
| Physical Description: | 259-292 |
| ISSN: | 0324-721X |