Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)最新文献_第4页

Spatial communication capacity based on electromagnetic wave equations 基于电磁波方程的空间通信容量

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936200

J. Hui, C. Bi, Hongxia Sun

引用次数: 10

On interleaver design for serially concatenated convolutional codes 串级卷积码的交织器设计

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936075

Ralph Höst, Stefan Johannesson, Ralph Jordan

引用次数: 6

Output distributions of lossless encoders with side information 带有侧信息的无损编码器的输出分布

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936079

J. Muramatsu, H. Koga, T. Mukouchi

引用次数: 1

On the undetected error probability for binary codes 关于二进制代码未检测到的错误概率

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936017

Fang-Wei Fu, T. Kløve, V. Wei

引用次数: 15

Spectral analysis of high order correlation immune functions 高阶相关免疫功能的频谱分析

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935932

Y. Tarannikov, D. Kirienko

引用次数: 19

Sphere-covering and measure concentration as source coding theorems 作为源编码定理的球覆盖和测度浓度

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936031

Ioannis Kontoyiannis

引用次数: 0

On Gallager-type bounds for the mismatched decoding regime with applications to turbo codes 不匹配译码的gallager型边界及其在turbo码中的应用

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935997

I. Sason, S. Shamai

引用次数: 2

Combined turbo coding and unitary space-time modulation turbo编码与酉空时调制的组合

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.935969

I. Bahceci, T. Duman

引用次数: 91

On the classical capacity of a quantum multiple-access channel 量子多址信道的经典容量

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936141

G.V. Klimovitch

引用次数: 11

Sensor placement in distributed sensor networks using a coding theory framework 使用编码理论框架的分布式传感器网络中的传感器放置

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI: 10.1109/ISIT.2001.936020

K. Chakrabarty, S. Iyengar

{"title":"Sensor placement in distributed sensor networks using a coding theory framework","authors":"K. Chakrabarty, S. Iyengar","doi":"10.1109/ISIT.2001.936020","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936020","url":null,"abstract":"An important issue in the design of distributed sensor networks is the optimal placement of sensors for target location. If the surveillance region, also referred to as the sensor field, is represented as a grid (two- or three-dimensional) of points (coordinates), target location refers to the problem of pin-pointing a target at a grid point at any point in time. For enhanced coverage, a large number of sensors are typically deployed in the sensor field, and if the coverage areas of multiple sensors overlap, they may all report a target in their respective zones. The precise location of the target must then be determined by examining the location of these sensors. Target location can be simplified considerably if the sensors are placed in such a way that every grid point in the sensor field is covered by a unique subset of sensors. The sensor placement problem for target location is closely related to the alarm placement problem, which refers to the problem of placing \"alarms\" on the nodes of a graph G such that a single fault in the system can be diagnosed. The alarms are therefore analogous to sensors in a sensor field. It was shown by Rao (1993) that the alarm placement problem is NP-complete for arbitrary graphs. However, for restricted topologies, e.g. a set of grid points in a sensor field, a coding theory framework can be used to efficiently determine sensor placement. The sensor locations correspond to codewords of an identifying code constructed over the grid points in the sensor field.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8