Paper Info
Title
Methods for Relativizing Properties of Codes.
Abstract
The usual setting for information transmission systems assumes thatall words over the source alphabet need to be encoded. The demandson encodings of messages with respect to decodability, error-detection,etc. are thus relative to the whole set of words. In reality, dependingon the information source, far fewer messages are transmitted, allbelonging to some specific language. Hence the original demands onencodings can be weakened, if only the words in that language areto be considered. This leads one to relativize the properties ofencodings or codes to the language at hand.We analyse methods of relativization in this sense. It seems thereare four equally convincing notions of relativization. We comparethose. 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 Pis a property defining a class of codes and L is a language, oneasks, for a given language C, whether C satisfies P relativeto L. We show that in the realm of regular languages this questionis mostly decidable.
Year
DOI
Venue
2015
10.14232/actacyb.22.2.2015.3
Acta Cybern.
Field
DocType
Volume
Information system,Discrete mathematics,Realm,Communication channel,Information transmission,Decidability,Theoretical computer science,Interference (wave propagation),Regular language,Mathematics,Alphabet
Journal
22
Issue
ISSN
Citations 
2
0324-721X
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Helmut Jürgensen120843.68
Lila Kari21123124.45
Steffen Kopecki3689.97