Results 251 to 260 of about 174,410 (300)
Some of the next articles are maybe not open access.

Efficient secret broadcast in the broadcasting networks

IEEE Communications Letters, 2009
One of the basic problems in the broadcasting networks is a secret broadcast problem. The problem is how to securely send a message to the receivers while guaranteeing consistency. Consistency means that each receiver can assure that all of the receivers have received the same message.
Ik Rae Jeong   +2 more
openaire   +1 more source

Beyond broadcast

Proceedings of the 8th international conference on Intelligent user interfaces - IUI '03, 2003
The work presented in this paper takes a novel approach to the task of providing information to viewers of broadcast news. Instead of considering the broadcast news as the end product, this work uses it as a starting point to dynamically build an information space for the user to explore.
Kevin Livingston   +3 more
openaire   +1 more source

Broadcasting with Feedback

2007 IEEE International Symposium on Information Theory, 2007
The availability of noiseless feedback in an additive white Gaussian noise channel can considerably improve the rate of decay of error-probability with block length. A doubly exponential error decay can be attained even in the presence of an additive interference term non-causally known at the transmitter alone.
openaire   +2 more sources

Broadcasting Dignity and Broadcasting Language

HAN-GEUL, 2017
이 글의 목적은 방송의 품위와 방송언어의 관계를 규명하는 데 있다. 방송의 품위는 공공성(진실 가치)과 건전성(도덕적 가치)으로 구성된다. 방송의 품위 기준에 따라서 방송언어의 실용적 평가 요소로 여섯 가지 - 공정성, 정확성, 언어 예절, 인권 존중, 선정성, 폭력성-가 제시될 수 있다. 공정성은 방송언어가 공정하고 객관적인가? 정확성은 어문 규정에 맞게 사용되었는가? 언어 예절은 언어 규범에 맞게 사용되었는가? 인권 존중은 차별적인 표현이나 비하 표현을 사용하였는가? 선정성은 성적 표현이 사용되었는가? 폭력성은 폭력적인 언어가 사용되었는가? 방송언어의 실용적 평가 요소를 바탕으로 방송언어의 분석 항목을 설정할 수 있다. 이
openaire   +1 more source

On secure broadcasting

2008 42nd Asilomar Conference on Signals, Systems and Computers, 2008
We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the degraded multi-receiver wiretap channel where the legitimate receivers exhibit a degradedness order while the ...
Ersen Ekrem, Sennur Ulukus
openaire   +2 more sources

Broadcast-relay-broadcast channels

2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers, 2010
In this paper, we study the achievable rate regions of broadcast-relay-broadcast channels. The source broadcasts information to the users. A number of parallel relays are used to assist users. Each relay receives information from the source and forwards information to users. The relays also broadcast the forwarded information to all users.
openaire   +1 more source

Programming with broadcasts

1993
[Pra91, Pra92] develop CBS, a CCS-like calculus [Mil89] where processes communicate by broadcasting values along a single channel. These values are hidden or restricted by translation to noise. This paper types CBS and restricts it to processes with a unique response to each input.
openaire   +2 more sources

Broadcast Authentication and Broadcast Encryption

2014
Broadcast authentication schemes that employ only symmetric PRFs include certificates-based schemes like one-time-signatures (OTS), and timed efficient stream loss tolerant authentication (TESLA), and identity-based schemes based on probabilistic subset allocation.
openaire   +1 more source

Broadcast channels

IEEE Transactions on Information Theory, 1972
We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified.
openaire   +4 more sources

Broadcasting in time

1996
In the calculus of broadcasting systems (CBS), speech is autonomous, but hearing takes place only when the environment speaks. This paper develops a timed CBS (TCBS) where no time may pass if there is speech pending. A process wishing to speak can be forced, by attaching a time-out to it, to first listen for a specified length of time.
openaire   +2 more sources

Home - About - Disclaimer - Privacy