Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523631
Karen Su, I. Wassell
This paper presents a new MIMO detector based on successive projection of the received signal onto the faces of the lattice induced by the channel matrix. Analysis of the relationship between successive algorithms like V-BLAST and the maximum likelihood (ML) sphere decoder, which share a common underlying tree structure, leads to the design of the successive projection algorithm (SPA). Although it is a suboptimal detector, we prove theoretically that when ML detection can be realized in a successive manner, i.e., without back-tracking, ML performance is also achieved by the SPA. The advantageous implications of this result are illustrated via simulation of the average bit error rates attained over a 4 times 4 MIMO flat fading channel. For instance, at a target error rate of 10-3 using 16-QAM modulation, a 2.8 dB improvement over the popular V-BLAST detector is observed at a comparable complexity. We also demonstrate a parameterized SPA, which offers performance profiles approaching that of an ML detector
{"title":"Efficient MIMO detection by successive projection","authors":"Karen Su, I. Wassell","doi":"10.1109/ISIT.2005.1523631","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523631","url":null,"abstract":"This paper presents a new MIMO detector based on successive projection of the received signal onto the faces of the lattice induced by the channel matrix. Analysis of the relationship between successive algorithms like V-BLAST and the maximum likelihood (ML) sphere decoder, which share a common underlying tree structure, leads to the design of the successive projection algorithm (SPA). Although it is a suboptimal detector, we prove theoretically that when ML detection can be realized in a successive manner, i.e., without back-tracking, ML performance is also achieved by the SPA. The advantageous implications of this result are illustrated via simulation of the average bit error rates attained over a 4 times 4 MIMO flat fading channel. For instance, at a target error rate of 10-3 using 16-QAM modulation, a 2.8 dB improvement over the popular V-BLAST detector is observed at a comparable complexity. We also demonstrate a parameterized SPA, which offers performance profiles approaching that of an ML detector","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127974914","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523540
C. Méasson, R. Urbanke, A. Montanari, T. Richardson
We derive further properties of EXIT and generalized EXIT curves. In particular we present an area theorem for iterative (as compared to MAP) decoding, we show how to compute upper-bounds on the MAP threshold for general channels and we apply these techniques to turbo codes
{"title":"Maximum a posteriori decoding and turbo codes for general memoryless channels","authors":"C. Méasson, R. Urbanke, A. Montanari, T. Richardson","doi":"10.1109/ISIT.2005.1523540","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523540","url":null,"abstract":"We derive further properties of EXIT and generalized EXIT curves. In particular we present an area theorem for iterative (as compared to MAP) decoding, we show how to compute upper-bounds on the MAP threshold for general channels and we apply these techniques to turbo codes","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115834105","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523607
Ioannis Kontoyiannis, L. A. Lastras-Montaño, Sean P. Meyn
We develop explicit, general bounds for the probability that the normalized partial sums of a function of a Markov chain on a general alphabet would exceed the steady-state mean of that function by a given amount. Our bounds combine simple information-theoretic ideas together with techniques from optimization and some fairly elementary tools from analysis. In one direction, we obtain a general bound for the important class of Doeblin chains; this bound is optimal, in the sense that in the special case of independent and identically distributed random variables it essentially reduces to the classical Hoeffding bound. In another direction, motivated by important problems in simulation, we develop a series of bounds in a form which is particularly suited to these problems, and which apply to the more general class of "geometrically ergodic" Markov chains
{"title":"Relative entropy and exponential deviation bounds for general Markov chains","authors":"Ioannis Kontoyiannis, L. A. Lastras-Montaño, Sean P. Meyn","doi":"10.1109/ISIT.2005.1523607","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523607","url":null,"abstract":"We develop explicit, general bounds for the probability that the normalized partial sums of a function of a Markov chain on a general alphabet would exceed the steady-state mean of that function by a given amount. Our bounds combine simple information-theoretic ideas together with techniques from optimization and some fairly elementary tools from analysis. In one direction, we obtain a general bound for the important class of Doeblin chains; this bound is optimal, in the sense that in the special case of independent and identically distributed random variables it essentially reduces to the classical Hoeffding bound. In another direction, motivated by important problems in simulation, we develop a series of bounds in a form which is particularly suited to these problems, and which apply to the more general class of \"geometrically ergodic\" Markov chains","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131452172","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523281
A. Kansal, A. Ramamoorthy, M. Srivastava, G. Pottie
Fidelity is one of the key considerations in data collection schemes for sensor networks. A second important consideration is the energy expense of achieving that fidelity. Data from multiple correlated sensors is collected over multi-hop routes and fused to reproduce the phenomenon. However, the same distortion may be achieved using multiple rate allocations among the correlated sensors. These rate allocations would typically have different energy cost in routing depending on the network topology. We consider the interplay between these two considerations of distortion and energy. First, we describe the various factors that affect this trade-off. Second, we discuss bounds on the achievable performance with respect to this trade-off. Specifically, we relate the network lifetime Lt to the distortion D of the delivered data. Finally, we present low-complexity approximations for the efficient computation of the Lt(D) bound
{"title":"On sensor network lifetime and data distortion","authors":"A. Kansal, A. Ramamoorthy, M. Srivastava, G. Pottie","doi":"10.1109/ISIT.2005.1523281","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523281","url":null,"abstract":"Fidelity is one of the key considerations in data collection schemes for sensor networks. A second important consideration is the energy expense of achieving that fidelity. Data from multiple correlated sensors is collected over multi-hop routes and fused to reproduce the phenomenon. However, the same distortion may be achieved using multiple rate allocations among the correlated sensors. These rate allocations would typically have different energy cost in routing depending on the network topology. We consider the interplay between these two considerations of distortion and energy. First, we describe the various factors that affect this trade-off. Second, we discuss bounds on the achievable performance with respect to this trade-off. Specifically, we relate the network lifetime Lt to the distortion D of the delivered data. Finally, we present low-complexity approximations for the efficient computation of the Lt(D) bound","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132033669","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523655
H. Feng
In this paper, we first present new upper and lower bounds for the rate loss of multiple description source codes (MDSCs). For a two-description MDSC (2DSC), the rate loss of description i with distortion Di is Li = Ri $R(Di ), i isin {1, 2}, where Ri is the rate of the ith description; the joint rate loss associated with decoding the two descriptions together to achieve central distortion D0 is L 0 = R1 + R2 - R(D0). We show that given any memoryless source with variance sigma2 and mean squared error distortion measure, for any optimal 2DSC, (a) 0 les L0 les 0.8802 if D0 les D1 + D2 - sigma2; (b) 0 les L1, L2 les 0.4401 if D0 ges (1/D1 + 1/D2 - 1/sigma2)-1; (c) 0 les L1, L2 les 0.3802 and R(max{D1, D2}) - 1 les L0 les R(max{D1, D2}) + 0.3802 otherwise. We also present a tighter bound on the distance between the El Gamal-Cover inner bound and the achievable region. In addition, these new bounds, which are easy to compute, inspire new designs of low-complexity near-optimal 2DSC. In essence, we demonstrate that any optimal 2DSC can be nearly separated into a multi-resolution source code and a traditional single-resolution code, and the resulting rate penalty for each description is less than 0.6901 bit/sample for general sources and less than 0.5 bit/sample for successively refinable sources
在本文中，我们首先提出了多描述源代码(MDSCs)的速率损失的上下界。对于双描述MDSC (2DSC)，具有畸变Di的描述i的速率损失为Li = Ri $R(Di)， i = in{1,2}，其中Ri为第i个描述的速率;将两种描述一起解码以实现中心失真D0的联合速率损失为l0 = R1 + R2 - R(D0)。我们证明了给定任何方差为sigma2且均方误差失真测量的无记忆源，对于任何最优的2DSC， (a)如果D0小于D1 + D2 - sigma2，则L0小于0.8802;(b)当D0 ges (1/D1 + 1/D2 -1 /sigma2)-1时，0 les L1, L2 les 0.4401;(c) 0列L1, L2列0.3802,R(max{D1, D2}) - 1列L0列R(max{D1, D2}) + 0.3802，否则。我们还提出了El gamal -盖层内界与可达区域之间距离的更严格的界限。此外，这些易于计算的新边界激发了低复杂度近最优2DSC的新设计。从本质上讲，我们证明了任何最优的2DSC几乎可以分为多分辨率源代码和传统的单分辨率代码，并且对于一般源，每个描述的结果率惩罚小于0.6901比特/样本，对于连续可细化源，每个描述的结果率惩罚小于0.5比特/样本
{"title":"Near separability of optimal multiple description source codes","authors":"H. Feng","doi":"10.1109/ISIT.2005.1523655","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523655","url":null,"abstract":"In this paper, we first present new upper and lower bounds for the rate loss of multiple description source codes (MDSCs). For a two-description MDSC (2DSC), the rate loss of description i with distortion D<sub>i</sub> is L<sub>i</sub> = R<sub>i</sub> $R(D<sub>i </sub>), i isin {1, 2}, where R<sub>i</sub> is the rate of the ith description; the joint rate loss associated with decoding the two descriptions together to achieve central distortion D<sub>0</sub> is L <sub>0</sub> = R<sub>1</sub> + R<sub>2</sub> - R(D<sub>0</sub>). We show that given any memoryless source with variance sigma<sup>2</sup> and mean squared error distortion measure, for any optimal 2DSC, (a) 0 les L<sub>0</sub> les 0.8802 if D<sub>0</sub> les D<sub>1</sub> + D<sub>2</sub> - sigma<sup>2</sup>; (b) 0 les L<sub>1</sub>, L<sub>2 </sub> les 0.4401 if D<sub>0</sub> ges (1/D<sub>1</sub> + 1/D<sub>2 </sub> - 1/sigma<sup>2</sup>)<sup>-1</sup>; (c) 0 les L<sub>1</sub>, L<sub>2</sub> les 0.3802 and R(max{D<sub>1</sub>, D<sub>2</sub>}) - 1 les L<sub>0</sub> les R(max{D<sub>1</sub>, D<sub>2</sub>}) + 0.3802 otherwise. We also present a tighter bound on the distance between the El Gamal-Cover inner bound and the achievable region. In addition, these new bounds, which are easy to compute, inspire new designs of low-complexity near-optimal 2DSC. In essence, we demonstrate that any optimal 2DSC can be nearly separated into a multi-resolution source code and a traditional single-resolution code, and the resulting rate penalty for each description is less than 0.6901 bit/sample for general sources and less than 0.5 bit/sample for successively refinable sources","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132410677","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523777
G. Malewicz
This paper introduces a theory of avalanche-creating and error-controlling encoding schemes. We consider a Hamming space {0, 1} n and the problem of finding a bijection g : {0, 1}n rarr {0, 1}n, with inverse h = g-1, that creates avalanche and controls error. That is, for any vectors u and v that are at most b1 apart, their images g(u) and g(v) are at least b2 apart; and for any vectors v and e, the distance between h(g(v) + e) and v is at most the length of e (the distance from e to 0n) plus b3. It appears that the two objectives of achieving avalanche effect and error control simultaneously in a single encoding scheme are contradictory. This paper is the first attempt at understanding the tradeoffs. Toward this end, the paper determines nontrivial cases when desired encoding schemes can be efficiently constructed, cases when schemes exist but it is not known how to construct them efficiently, and cases when schemes do not exist at all
{"title":"Toward a theory of avalanche-creating and error-controlling encoding schemes","authors":"G. Malewicz","doi":"10.1109/ISIT.2005.1523777","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523777","url":null,"abstract":"This paper introduces a theory of avalanche-creating and error-controlling encoding schemes. We consider a Hamming space {0, 1} n and the problem of finding a bijection g : {0, 1}n rarr {0, 1}n, with inverse h = g-1, that creates avalanche and controls error. That is, for any vectors u and v that are at most b1 apart, their images g(u) and g(v) are at least b2 apart; and for any vectors v and e, the distance between h(g(v) + e) and v is at most the length of e (the distance from e to 0n) plus b3. It appears that the two objectives of achieving avalanche effect and error control simultaneously in a single encoding scheme are contradictory. This paper is the first attempt at understanding the tradeoffs. Toward this end, the paper determines nontrivial cases when desired encoding schemes can be efficiently constructed, cases when schemes exist but it is not known how to construct them efficiently, and cases when schemes do not exist at all","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130151458","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523523
V. Farias, C. Moallemi, Benjamin Van Roy, T. Weissman
We consider the problem of optimal control of a Kth order Markov process so as to minimize long-term average cost, a framework with many applications in communications and beyond. Specifically, we wish to do so without knowledge of either the transition kernel or even the order K. We develop and analyze two algorithms, based on the Lempel-Ziv scheme for data compression, that maintain probability estimates along variable length contexts. We establish that eventually, with probability 1, the optimal action is taken at each context. Further, in the case of the second algorithm, we establish almost sure asymptotic optimality
{"title":"A universal scheme for learning","authors":"V. Farias, C. Moallemi, Benjamin Van Roy, T. Weissman","doi":"10.1109/ISIT.2005.1523523","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523523","url":null,"abstract":"We consider the problem of optimal control of a Kth order Markov process so as to minimize long-term average cost, a framework with many applications in communications and beyond. Specifically, we wish to do so without knowledge of either the transition kernel or even the order K. We develop and analyze two algorithms, based on the Lempel-Ziv scheme for data compression, that maintain probability estimates along variable length contexts. We establish that eventually, with probability 1, the optimal action is taken at each context. Further, in the case of the second algorithm, we establish almost sure asymptotic optimality","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134225091","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523572
S. Draper, Cheng Chang, A. Sahai
Random binning arguments underlie many results in information theory. In this paper we introduce and analyze a novel type of causal random binning "sequential" binning. This binning is used to get streaming Slepian-Wolf codes with an "anytime" character. At the decoder, the probability of estimation error on any particular symbol goes to zero exponentially fast with delay. In the non-distributed context, we show equivalent results for fixed-rate streaming entropy coding. Because of space constraints, we present full derivations only for the latter, stating the results for the distributed problem. We give bounds on error exponents for both universal and maximum-likelihood decoders
{"title":"Sequential random binning for streaming distributed source coding","authors":"S. Draper, Cheng Chang, A. Sahai","doi":"10.1109/ISIT.2005.1523572","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523572","url":null,"abstract":"Random binning arguments underlie many results in information theory. In this paper we introduce and analyze a novel type of causal random binning \"sequential\" binning. This binning is used to get streaming Slepian-Wolf codes with an \"anytime\" character. At the decoder, the probability of estimation error on any particular symbol goes to zero exponentially fast with delay. In the non-distributed context, we show equivalent results for fixed-rate streaming entropy coding. Because of space constraints, we present full derivations only for the latter, stating the results for the distributed problem. We give bounds on error exponents for both universal and maximum-likelihood decoders","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134527526","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523297
H. Feng, M. Effros
In this paper, we first define and bound the rate loss of source codes for broadcast channels. Our broadcast channel model comprises one transmitter and two receivers; the transmitter is connected to each receiver by a private channel and to both receivers by a common channel. The transmitter sends a description of source (X, Y) through these channels, receiver 1 reconstructs X with distortion D1, and receiver 2 reconstructs Y with distortion D2. Suppose the rates of the common channel and private channels 1 and 2 are R0, R1, and R2, respectively. The work of Gray and Wyner gives a complete characterization of all achievable rate triples (R0,R1,R2) given any distortion pair (D1,D2). In this paper, we define the rate loss as the gap between the achievable region and the outer bound composed by the rate-distortion functions, i.e., R0+R1+R2 ≥ RX,Y (D1,D2), R0 + R1 ≥ RX(D1), and R0 + R2 ≥ RY (D2). We upper bound the rate loss for general sources by functions of distortions and upper bound the rate loss for Gaussian sources by constants, which implies that though the outer bound is generally not achievable, it may be quite close to the achievable region. This also bounds the gap between the achievable region and the inner bound proposed by Gray and Wyner and bounds the performance penalty associated with using separate decoders rather than joint decoders. We then construct such source codes using entropy-constrained dithered quantizers. The resulting implementation has low complexity and performance close to the theoretical optimum. In particular, the gap between its performance and the theoretical optimum can be bounded from above by constants for Gaussian sources.
{"title":"On the rate loss and construction of source codes for broadcast channels","authors":"H. Feng, M. Effros","doi":"10.1109/ISIT.2005.1523297","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523297","url":null,"abstract":"In this paper, we first define and bound the rate loss of source codes for broadcast channels. Our broadcast channel model comprises one transmitter and two receivers; the transmitter is connected to each receiver by a private channel and to both receivers by a common channel. The transmitter sends a description of source (X, Y) through these channels, receiver 1 reconstructs X with distortion D1, and receiver 2 reconstructs Y with distortion D2. Suppose the rates of the common channel and private channels 1 and 2 are R0, R1, and R2, respectively. The work of Gray and Wyner gives a complete characterization of all achievable rate triples (R0,R1,R2) given any distortion pair (D1,D2). In this paper, we define the rate loss as the gap between the achievable region and the outer bound composed by the rate-distortion functions, i.e., R0+R1+R2 ≥ RX,Y (D1,D2), R0 + R1 ≥ RX(D1), and R0 + R2 ≥ RY (D2). We upper bound the rate loss for general sources by functions of distortions and upper bound the rate loss for Gaussian sources by constants, which implies that though the outer bound is generally not achievable, it may be quite close to the achievable region. This also bounds the gap between the achievable region and the inner bound proposed by Gray and Wyner and bounds the performance penalty associated with using separate decoders rather than joint decoders. We then construct such source codes using entropy-constrained dithered quantizers. The resulting implementation has low complexity and performance close to the theoretical optimum. In particular, the gap between its performance and the theoretical optimum can be bounded from above by constants for Gaussian sources.","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132598530","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523703
Jun Cheng, K. Kamoi, Y. Watanabe
Error-correcting signature code is proposed. An n/2-decodable signature code with code length n - 1 and cardinality n - 1 is developed from an Hadamard matrix of order n. The code is used to identify users through the multiple-access adder channel, even in the presence of channel noise
{"title":"Error-correcting signature code for multiple-access adder channel","authors":"Jun Cheng, K. Kamoi, Y. Watanabe","doi":"10.1109/ISIT.2005.1523703","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523703","url":null,"abstract":"Error-correcting signature code is proposed. An n/2-decodable signature code with code length n - 1 and cardinality n - 1 is developed from an Hadamard matrix of order n. The code is used to identify users through the multiple-access adder channel, even in the presence of channel noise","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740037","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
扫码关注我们
求助内容：
应助结果提醒方式：