東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Reliable and secure communication sc...

Liu, Ruoheng.

FindBook

Google Book

Amazon

博客來

Reliable and secure communication schemes for wireless networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Reliable and secure communication schemes for wireless networks./
作者:	Liu, Ruoheng.
面頁冊數:	175 p.
附註:	Adviser: Predrag Spasojevic.
Contained By:	Dissertation Abstracts International68-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3277305
ISBN:	9780549192633

Reliable and secure communication schemes for wireless networks.
Liu, Ruoheng.

Reliable and secure communication schemes for wireless networks. - 175 p.

Adviser: Predrag Spasojevic.

Thesis (Ph.D.)--Rutgers The State University of New Jersey - New Brunswick, 2007.

The focus of this dissertation is on reliable and secure communication schemes. This topic is motivated by the vast increase in the amount of data which is transmitted, compressed, and stored every day, in particular via wireless networks. The need for reliable and secure communications is more important than ever before. The dissertation studies properties of the so-called good codes, their performance and design with several communication schemes essential to reliability of wireless networks, and concludes with the study of rate achievable with good random codes when also perfect message confidentiality is desired.

ISBN: 9780549192633Subjects--Topical Terms:

626642
Computer Science.

Reliable and secure communication schemes for wireless networks.
LDR:03441nam 2200313 a 45 001 948608
005 20110524
008 110524s2007 ||||||||||||||||| ||eng d
020 $a 9780549192633
035 $a (UMI)AAI3277305
035 $a AAI3277305
040 $a UMI $c UMI
100 1 $a Liu, Ruoheng. $3 1086081
245 1 0 $a Reliable and secure communication schemes for wireless networks.
300 $a 175 p.
500 $a Adviser: Predrag Spasojevic.
500 $a Source: Dissertation Abstracts International, Volume: 68-08, Section: B, page: 5460.
502 $a Thesis (Ph.D.)--Rutgers The State University of New Jersey - New Brunswick, 2007.
520 $a The focus of this dissertation is on reliable and secure communication schemes. This topic is motivated by the vast increase in the amount of data which is transmitted, compressed, and stored every day, in particular via wireless networks. The need for reliable and secure communications is more important than ever before. The dissertation studies properties of the so-called good codes, their performance and design with several communication schemes essential to reliability of wireless networks, and concludes with the study of rate achievable with good random codes when also perfect message confidentiality is desired.
520 $a We first focus on the class of good codes, including turbo, low-density parity-check, and repeat-accumulate codes. Their performance is characterized by a threshold behavior in a single channel model. We investigate the weight spectrum of good code sequences and derive a necessary and sufficient goodness condition for binary-symmetric and additive white Gaussian noise channels.
520 $a Next, we study the error probability performance of good codes for parallel communication channels. We investigate reliable channel regions which ensure reliable communications over parallel channels with good code ensembles. To construct reliable regions, we study the modified 1961 Gallager bound for parallel channels. By allowing codeword bits to be randomly assigned to each component channel, the average parallel-channel Gallager bound is simplified to be a function of code weight enumerators and channel assignment rates. Special cases of this bound, Union-Bhattacharyya, Shulman-Feder, Simplified-Sphere, and Modified Shulman-Feder parallel-channel bounds, allow for describing reliable channel regions using simple functions of channel and code spectrum parameters.
520 $a Finally, we focus on information-theoretic security for multi-terminal networks. We consider discrete memoryless interference and broadcast channels in which independent confidential messages are sent to two receivers. We also consider a two-user discrete multiple-access channel in which one user wishes to communicate confidential messages to a common receiver while the other user is permitted to eavesdrop. Confidential messages are transmitted to the desired receiver with perfect secrecy, as measured by the equivocation rate at the other receiver. We derive inner and outer bounds for the achievable rate regions for these three communication systems, achievable by good random binning codes.
590 $a School code: 0190.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
690 $a 0984
710 2 $a Rutgers The State University of New Jersey - New Brunswick. $3 1017590
773 0 $t Dissertation Abstracts International $g 68-08B.
790 $a 0190
790 1 0 $a Spasojevic, Predrag, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3277305