A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. II. Applications
About optimum signalling of information
Basic equations for source coding with side information at the decoder and encoder
Calculation of the detection properties in the binary symmetrical channel
One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this...
Capacity of fully correlated MIMO system using character expansion of groups.
Cascaded Channels and the Equivocation Inequality.
Channels with additive asymptotically mean stationary noise
Continuity and quantization of channels with infinite alphabets
Décomposition de -matrice et buffer d’un multiplexeur ATM
Ergodicity and extremality of AMS sources and channels.
Estimation of channel holding time distribution in cellular telephone systems.
Information channels composed of memoryless components
Joint queue-perturbed and weakly coupled power control for wireless backbone networks
Wireless Backbone Networks (WBNs) equipped with Multi-Radio Multi-Channel (MRMC) configurations do experience power control problems such as the inter-channel and co-channel interference, high energy consumption at multiple queues and unscalable network connectivity. Such network problems can be conveniently modelled using the theory of queue perturbation in the multiple queue systems and also as a weak coupling in a multiple channel wireless network. Consequently, this paper proposes a queue perturbation...
Multiple channels under fidelity criteria
On a tree collision resolution algorithm in presence of capture
On broadcast channels with side information under fidelity criteria
On capacity regions of discrete asynchronous multiple access channels
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
On the capacity of asymptotically mean stationary channels
On the detection of a complex finite binary sequence in the presence of an interfering complex binary sequence
On the identification of a subclass of finite state channels and their capacity