Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936200
J. Hui, C. Bi, Hongxia Sun
We study directly the geometric properties of electromagnetic waves to derive the channel capacity of multiple antenna systems. Spatial system transfer functions and spatial sampling theory are used, instead of the usual independent and complex Gaussian assumption.
{"title":"Spatial communication capacity based on electromagnetic wave equations","authors":"J. Hui, C. Bi, Hongxia Sun","doi":"10.1109/ISIT.2001.936200","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936200","url":null,"abstract":"We study directly the geometric properties of electromagnetic waves to derive the channel capacity of multiple antenna systems. Spatial system transfer functions and spatial sampling theory are used, instead of the usual independent and complex Gaussian assumption.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"52 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":"121210395","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936075
Ralph Höst, Stefan Johannesson, Ralph Jordan
Serially concatenated convolutional codes are considered. The free distance of this construction is shown to be lower-bounded by the product of the free distances of the outer and inner codes, if the precipices of the interleaver are sufficiently large. It is shown how to construct a convolutional scrambler with a given precipice.
{"title":"On interleaver design for serially concatenated convolutional codes","authors":"Ralph Höst, Stefan Johannesson, Ralph Jordan","doi":"10.1109/ISIT.2001.936075","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936075","url":null,"abstract":"Serially concatenated convolutional codes are considered. The free distance of this construction is shown to be lower-bounded by the product of the free distances of the outer and inner codes, if the precipices of the interleaver are sufficiently large. It is shown how to construct a convolutional scrambler with a given precipice.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"40 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":"121322253","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936079
J. Muramatsu, H. Koga, T. Mukouchi
We present that the output distribution of lossless source encoders with correlated side information is asymptotically independent of the side information. Based on this, we can construct a random number generator that produces mutually asymptotically independent random sequences from random sequences emitted from correlated sources.
{"title":"Output distributions of lossless encoders with side information","authors":"J. Muramatsu, H. Koga, T. Mukouchi","doi":"10.1109/ISIT.2001.936079","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936079","url":null,"abstract":"We present that the output distribution of lossless source encoders with correlated side information is asymptotically independent of the side information. Based on this, we can construct a random number generator that produces mutually asymptotically independent random sequences from random sequences emitted from correlated sources.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"29 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":"125162281","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936017
Fang-Wei Fu, T. Kløve, V. Wei
In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.
{"title":"On the undetected error probability for binary codes","authors":"Fang-Wei Fu, T. Kløve, V. Wei","doi":"10.1109/ISIT.2001.936017","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936017","url":null,"abstract":"In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"56 3 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":"126022289","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935932
Y. Tarannikov, D. Kirienko
We consider F/sub 2//sup n/, the vector space of n-tuples of elements from F/sub 2/. An n-variable Boolean function is a map from F/sub 2//sup n/ into F/sub 2/. The weight of a vector x is the number of ones in x and is denoted by |x|. The weight wt(f) of a function f on F/sub 2//sup n/ is the number of vectors x on F/sub 2//sup n/ such that f(x)=1. A function f is said to be balance if wt(f)=wt(f/spl oplus/1)=2/sup n-1/. A subfunction of the Boolean function f is a function f/spl acute/ obtained by substituting some constants for some variables in f.
{"title":"Spectral analysis of high order correlation immune functions","authors":"Y. Tarannikov, D. Kirienko","doi":"10.1109/ISIT.2001.935932","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935932","url":null,"abstract":"We consider F/sub 2//sup n/, the vector space of n-tuples of elements from F/sub 2/. An n-variable Boolean function is a map from F/sub 2//sup n/ into F/sub 2/. The weight of a vector x is the number of ones in x and is denoted by |x|. The weight wt(f) of a function f on F/sub 2//sup n/ is the number of vectors x on F/sub 2//sup n/ such that f(x)=1. A function f is said to be balance if wt(f)=wt(f/spl oplus/1)=2/sup n-1/. A subfunction of the Boolean function f is a function f/spl acute/ obtained by substituting some constants for some variables in f.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"171 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":"126131230","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936031
Ioannis Kontoyiannis
We state and solve a general version of the rate-distortion problem. We show that its answer contains, as corollaries: (i) Stein's lemma in hypothesis testing; (ii) Shannon's (1959) lossy source coding theorem; and (iii) new converses to measure-concentration inequalities.
{"title":"Sphere-covering and measure concentration as source coding theorems","authors":"Ioannis Kontoyiannis","doi":"10.1109/ISIT.2001.936031","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936031","url":null,"abstract":"We state and solve a general version of the rate-distortion problem. We show that its answer contains, as corollaries: (i) Stein's lemma in hypothesis testing; (ii) Shannon's (1959) lossy source coding theorem; and (iii) new converses to measure-concentration inequalities.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"51 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":"115085167","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935997
I. Sason, S. Shamai
The generalized Duman & Salehi (see IEEE Trans. on Communications, vol.46, no.6, p.717-23, 1998) bound is used in the realm of mismatch decoding metric for random and deterministic codes. In the random coding case with a proper restriction of the random ensemble, the technique reconstructs the Csizar-Korner-Hui lower bound. For deterministic codes, the bound is given in terms of the distance spectrum of the code and the results are demonstrated for fading channels with an estimate of the fading channel state information.
{"title":"On Gallager-type bounds for the mismatched decoding regime with applications to turbo codes","authors":"I. Sason, S. Shamai","doi":"10.1109/ISIT.2001.935997","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935997","url":null,"abstract":"The generalized Duman & Salehi (see IEEE Trans. on Communications, vol.46, no.6, p.717-23, 1998) bound is used in the realm of mismatch decoding metric for random and deterministic codes. In the random coding case with a proper restriction of the random ensemble, the technique reconstructs the Csizar-Korner-Hui lower bound. For deterministic codes, the bound is given in terms of the distance spectrum of the code and the results are demonstrated for fading channels with an estimate of the fading channel state information.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"16 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":"122776923","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.935969
I. Bahceci, T. Duman
We present a scheme employing turbo codes together with unitary space-time constellations for Rayleigh block fading channels when no channel state information (CSI) is available. We present via simulations that coding gains up to 16 dB is possible over the original uncoded system at a bit error rate of 10/sup -5/.
{"title":"Combined turbo coding and unitary space-time modulation","authors":"I. Bahceci, T. Duman","doi":"10.1109/ISIT.2001.935969","DOIUrl":"https://doi.org/10.1109/ISIT.2001.935969","url":null,"abstract":"We present a scheme employing turbo codes together with unitary space-time constellations for Rayleigh block fading channels when no channel state information (CSI) is available. We present via simulations that coding gains up to 16 dB is possible over the original uncoded system at a bit error rate of 10/sup -5/.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"10 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":"122662241","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936141
G.V. Klimovitch
We analyze the quantum adder channel, i.e. the extension of a classical multiple-access additive binary channel to the quantum regime, in which quantum bits (qubits) rather than classical bits are transmitted. Quantum entanglement between different transmitters and/or the receiver results in a significant expansion of the capacity region of the channel, in comparison with its classical counterpart, a property which can be used, e.g., to considerably improve bandwidth efficiency of fiber communication networks in the future.
{"title":"On the classical capacity of a quantum multiple-access channel","authors":"G.V. Klimovitch","doi":"10.1109/ISIT.2001.936141","DOIUrl":"https://doi.org/10.1109/ISIT.2001.936141","url":null,"abstract":"We analyze the quantum adder channel, i.e. the extension of a classical multiple-access additive binary channel to the quantum regime, in which quantum bits (qubits) rather than classical bits are transmitted. Quantum entanglement between different transmitters and/or the receiver results in a significant expansion of the capacity region of the channel, in comparison with its classical counterpart, a property which can be used, e.g., to considerably improve bandwidth efficiency of fiber communication networks in the future.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"28 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":"129477956","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}
Pub Date : 2001-06-24DOI: 10.1109/ISIT.2001.936020
K. Chakrabarty, S. Iyengar
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：