{"title":"The zero-error capacity of compound channels","authors":"J. Nayak, K. Rose","doi":"10.1109/ISIT.2004.1365414","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365414","url":null,"abstract":"The compound channel is one of the simplest generalizations of the discrete memoryless channel (DMC). In this paper, we characterize the zero-error capacity when neither the encoder nor the decoder is informed of the choice of DMC s. We present a complete characterization of the compound channel capacities","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131424361","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}
{"title":"Capacity approaching codes for relay channels","authors":"Zheng Zhang, I. Bahceci, T. Duman","doi":"10.1109/ISIT.2004.1365039","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365039","url":null,"abstract":"In this paper, turbo-based coding scheme for relay systems together with iterative decoding algorithms is designed. The performance of the proposed schemes is about 1.0-1.5 dB away from the information theoretical limits for various channel models.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124444799","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}
{"title":"Selection diversity in multiple antenna systems with matrix modulation","authors":"P. Pasanen, O. Tirkkonen","doi":"10.1109/ISIT.2004.1365328","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365328","url":null,"abstract":"Scheduling between several users introduces selection diversity and changes the statistics of the channel. Therefore, the problem of choosing the best user/transmission scheme in multiuser MIMO systems needs to be addressed. This work presents the selection diversity in multiple antenna systems with matrix modulation.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115067099","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}
{"title":"New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures","authors":"Annalisa De Bonis, U. Vaccaro","doi":"10.1109/ISIT.2004.1365291","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365291","url":null,"abstract":"Let s be the number of unknown positive elements in a population of n members, 2/spl les/s<n. We aim at finding all the s positive elements by testing group of members of the population, under the constraint that a group tests positive if and only if it contains exactly one positive element. This model was considered in [T. Berger et al., 1984, P. Damaschke, 1998]. We provide tight upper and lower bounds on the optimal number of tests needed to solve above group testing problem, improving on [A.G. Dyachkov, 2003]. Instrumental to our results are new and improved bounds for generalized superimposed codes in the sense of [A. De Bonis et al., 2003, A.G. Dyachkov et al., 1984].","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530609","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}
{"title":"Computing and communicating statistics in sensor networks","authors":"A. Giridhar, P. Kumar","doi":"10.1109/ISIT.2004.1365117","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365117","url":null,"abstract":"This paper presents the computing and communicating statistics in sensor networks. A deterministic sequence of message passing between sensors, result in the vector of function values being, communicated to the fusion center, for any combination of individual measurement vectors. A wireless communication model using protocols is also discussed.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919367","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}
{"title":"Reconstruction of a linear scrambler","authors":"M. Cluzeau","doi":"10.1109/ISIT.2004.1365271","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365271","url":null,"abstract":"We present different techniques to reconstruct a linear scrambler from the knowledge of a large segment of the output stream, according to various assumptions on the input stream. A communication system usually includes a linear scrambler, which consists of a linear feedback shift register (LFSR) whose output is combined with the input sequence. This paper also describes the synchronous scramblers and self-synchronized scramblers.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114729","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}
{"title":"On second-order properties of minimum redundancy block codes","authors":"Y. Reznik","doi":"10.1109/ISIT.2004.1365128","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365128","url":null,"abstract":"This paper presents the second-order properties of minimum redundancy block codes. A block Huffman code constructed for a binary memoryless source with probabilities is considered. The result proves that the variance of its redundancy distribution of block Shannon and Huffman code is distributed very uniformly between its codewords.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123954714","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}
{"title":"Analysis of an algorithm for irregular LDPC code construction","authors":"A. Ramamoorthy, R. Wesel","doi":"10.1109/ISIT.2004.1365107","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365107","url":null,"abstract":"This work presents a rigorous analysis of an algorithm proposed by Tian et al. (2003) for the construction of irregular LDPC codes with reduced stopping sets and low error floors. Computation of the expected number of stopping sets of a given size proves that the algorithm significantly outperforms a random construction. We show that the algorithm provably reduces the expected number of stopping sets up to a certain size (based on the input parameters). The expected number of cycles of a given size is computed for both constructions.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609165","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}
{"title":"Asymptotic capacity analysis of transmit antenna selection","authors":"S. Sanayei, Aria Nosratinia","doi":"10.1109/ISIT.2004.1365279","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365279","url":null,"abstract":"In this work we investigate the asymptotic behavior of the capacity of transmit antenna selection, in the limit of large number of transmit antennas, under both low and high SNR regimes. Antenna selection provides a low-cost low complexity solution for MIMO systems.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128424914","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}
{"title":"Space-time precoding with mean and covariance feedback: implications for wideband systems","authors":"G. Barriac, Upamanyu Madhow","doi":"10.1109/ISIT.2004.1365322","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365322","url":null,"abstract":"This paper focuses on optimizing the capacity of a cellular \"downlink\" in which the base station (BS) is equipped with multiple antennas, while the mobile has a single antenna. The BS has access to both the first and second order statistics of the channel, obtained from mean feedback and covariance feedback, respectively. Our results apply to wideband orthogonal frequency division multiplexing (OFDM) systems, where accurate covariance feedback is obtained without overhead by averaging uplink measurements. Mean feedback is obtained from uplink measurements using reciprocity for time division duplex (TDD) systems, and would require explicit feedback for frequency division duplex (FDD) systems. Since mean feedback degrades rapidly with feedback delay for mobile channels, and requires feedback overhead for FDD systems, our purpose is to quantify the tradeoffs in using covariance feedback alone versus using both covariance and mean feedback.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128447459","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}