Object

Title: Lower bound for E capacity of discrete memoryless channel with two-sided state information

Journal or Publication Title:

Математические вопросы кибернетики и вычислительной техники=Կիբեռնետիկայի և հաշվողական տեխնիկայի մաթեմատիկական հարցեր=Mathematical problems of computer science

Date of publication:

2008

Volume:

31

ISSN:

0131-4645

Additional Information:

click here to follow the link

Other title:

Երկկողմանի վիճակներով ընդհատ առանց հիշողության կապուղու E-ունակության ստորին գնահատականը

Coverage:

28-39

Abstract:

We study the channel with two-sided state information, a discrete memoryless channel with ¯nite input and output alphabets and random state sequence. Partial information about the state sequence is available to the encoder and decoder. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers. The capacity of this model was obtained by Cover and Chiang in [1]. In this paper the random coding bound of E-capacity is derived for considered model which can be called also generalized channel with state information, as it includes four possible situations of the channel with random parameter.

Publisher:

Изд-во НАН РА

Date created:

2008-10-10

Format:

pdf

Identifier:

oai:arar.sci.am:258567

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Object collections:

Last modified:

Dec 8, 2023

In our library since:

Jul 24, 2020

Number of object content hits:

28

All available object's versions:

https://arar.sci.am/publication/281654

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Objects

Similar

This page uses 'cookies'. More information