Pub Date : 2006-03-13DOI: 10.1109/ITW.2006.1633803
Payam Pakzad, A. Shokrollahi
In this paper we describe some practical aspects of the design process of good Raptor codes for finite block lengths over arbitrary binary input symmetric channels. In particular we introduce a simple model for the finite-length convergence behavior of the iterative decoding algorithm based on density evolution, and propose a practical design procedure. We report simulation results for some example codes.
{"title":"Design Principles for Raptor Codes","authors":"Payam Pakzad, A. Shokrollahi","doi":"10.1109/ITW.2006.1633803","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633803","url":null,"abstract":"In this paper we describe some practical aspects of the design process of good Raptor codes for finite block lengths over arbitrary binary input symmetric channels. In particular we introduce a simple model for the finite-length convergence behavior of the iterative decoding algorithm based on density evolution, and propose a practical design procedure. We report simulation results for some example codes.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372453","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}
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of the two players. We study Hannan consistent players for these games, that is, randomized playing strategies whose per-round regret vanishes with probability one as the number of game rounds goes to infinity. We prove a general lower bound for the convergence rate of the regret, and exhibit a specific strategy that attains this rate for any game for which a Hannan consistent player exists.
{"title":"Regret Minimization Under Partial Monitoring","authors":"N. Cesa-Bianchi, G. Lugosi, Gilles Stoltz","doi":"10.1287/moor.1060.0206","DOIUrl":"https://doi.org/10.1287/moor.1060.0206","url":null,"abstract":"We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of the two players. We study Hannan consistent players for these games, that is, randomized playing strategies whose per-round regret vanishes with probability one as the number of game rounds goes to infinity. We prove a general lower bound for the convergence rate of the regret, and exhibit a specific strategy that attains this rate for any game for which a Hannan consistent player exists.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680243","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633797
Deniz Gündüz, E. Erkip
In this paper, we consider transmission of a continuous amplitude source over a quasi-static MIMO Rayleigh fading channel. The performance metric is end-to-end distortion of the source caused both by the lossy compression and the channel errors. We are interested in the high SNR behavior expressed in the distortion exponent, which is the exponential decay rate of the average end-to-end distortion as a function of SNR. Our goal is to maximize this distortion exponent by considering joint source and channel coding techniques. We provide digital strategies that utilize layered source coding coupled with multi-rate channel coding either by progressive or by superposition transmission, as well as a hybrid digital-analog scheme. When either the transmitter or the receiver has one antenna, we show that we are able to achieve the optimal distortion exponent.
{"title":"Distortion Exponent of MIMO Fading Channels","authors":"Deniz Gündüz, E. Erkip","doi":"10.1109/ITW.2006.1633797","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633797","url":null,"abstract":"In this paper, we consider transmission of a continuous amplitude source over a quasi-static MIMO Rayleigh fading channel. The performance metric is end-to-end distortion of the source caused both by the lossy compression and the channel errors. We are interested in the high SNR behavior expressed in the distortion exponent, which is the exponential decay rate of the average end-to-end distortion as a function of SNR. Our goal is to maximize this distortion exponent by considering joint source and channel coding techniques. We provide digital strategies that utilize layered source coding coupled with multi-rate channel coding either by progressive or by superposition transmission, as well as a hybrid digital-analog scheme. When either the transmitter or the receiver has one antenna, we show that we are able to achieve the optimal distortion exponent.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123056842","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633808
A. Huebner, D. Costello
In this paper the impact of S-type permutors, i.e., permutors that provide a non-trivial separation, on the minimum distance of double serially concatenated convolutional codes is considered. A joint design of the outer and inner permutor is presented on the basis of a newly introduced permutor parameter - the so-called symbol span. This design guarantees that the minimum distance of the overall code is lower bounded by the product of the free distances of all three component codes. Simulation results are presented and comparisons with single serially concatenated and double/generalized repeat accumulate codes are briefly sketched.
{"title":"On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes","authors":"A. Huebner, D. Costello","doi":"10.1109/ITW.2006.1633808","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633808","url":null,"abstract":"In this paper the impact of S-type permutors, i.e., permutors that provide a non-trivial separation, on the minimum distance of double serially concatenated convolutional codes is considered. A joint design of the outer and inner permutor is presented on the basis of a newly introduced permutor parameter - the so-called symbol span. This design guarantees that the minimum distance of the overall code is lower bounded by the product of the free distances of all three component codes. Simulation results are presented and comparisons with single serially concatenated and double/generalized repeat accumulate codes are briefly sketched.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"123 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439061","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633792
H. Tapia-Recillas
As a continuation of the study of error-detecting correcting binary codes and codes over finite fields in general, several authors have been studying codes over some finite rings, particularly the ring Z4of integers modulo 4 and more generally codes over the ring Zpnof integers modulo pn(p a prime and n a positive integer). These rings are examples of Galois rings. In this note results appearing in the literature for codes over the ring Zpnare extended for codes over some Galois rings.
{"title":"Some Results on Codes over Galois Rings","authors":"H. Tapia-Recillas","doi":"10.1109/ITW.2006.1633792","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633792","url":null,"abstract":"As a continuation of the study of error-detecting correcting binary codes and codes over finite fields in general, several authors have been studying codes over some finite rings, particularly the ring Z<inf>4</inf>of integers modulo 4 and more generally codes over the ring Z<inf>p</inf><sup>n</sup>of integers modulo p<sup>n</sup>(p a prime and n a positive integer). These rings are examples of Galois rings. In this note results appearing in the literature for codes over the ring Z<inf>p</inf><sup>n</sup>are extended for codes over some Galois rings.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128717300","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633812
S. Servetto
We consider the multiterminal source coding problem with general discrete memoryless sources. In previous work, we developed new inner and outer bounds to its rate region, and gave an expression for the gap between them, which explicitly depends on the code maps. In this work, we first construct a class of codes for our problem, based on the method of backward channels used by Csiszár and Körner in their proof of the two-terminal rate/distortion theorem. Next, we show that for each one of the codes in this class, the gap between the inner and the outer bounds above does vanish. Finally, we present a summary of results obtained to date with this purely combinatorial approach, as well as a statement of what it would take to completely solve the problem following this line of attack.
{"title":"Backward Channels in Multiterminal Source Coding","authors":"S. Servetto","doi":"10.1109/ITW.2006.1633812","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633812","url":null,"abstract":"We consider the multiterminal source coding problem with general discrete memoryless sources. In previous work, we developed new inner and outer bounds to its rate region, and gave an expression for the gap between them, which explicitly depends on the code maps. In this work, we first construct a class of codes for our problem, based on the method of backward channels used by Csiszár and Körner in their proof of the two-terminal rate/distortion theorem. Next, we show that for each one of the codes in this class, the gap between the inner and the outer bounds above does vanish. Finally, we present a summary of results obtained to date with this purely combinatorial approach, as well as a statement of what it would take to completely solve the problem following this line of attack.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351307","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633836
N. Macris
We consider communication over binary input memoryless symmetric channels with low density parity check codes. The relationship between maximum a posteriori and belief propagation GEXIT functions is investigated using a set of correlation inequalities of statistical mechanics for Gaussian spin glasses. We use these to prove bounds that are believed to be tight and point out their close connection with the ones obtained by the interpolation method invented in the context of spin glasses.
{"title":"On the relation between MAP and BP GEXIT functions of low density parity check codes","authors":"N. Macris","doi":"10.1109/ITW.2006.1633836","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633836","url":null,"abstract":"We consider communication over binary input memoryless symmetric channels with low density parity check codes. The relationship between maximum a posteriori and belief propagation GEXIT functions is investigated using a set of correlation inequalities of statistical mechanics for Gaussian spin glasses. We use these to prove bounds that are believed to be tight and point out their close connection with the ones obtained by the interpolation method invented in the context of spin glasses.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121972678","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633824
K. Eswaran, M. Gastpar
An efficient distributed source coding system with two encoders and dependent data streams must remove two kinds of redundancy: redundancy in each stream and between the two streams. The striking result of Slepian and Wolf showed that the latter can be eliminated even if each encoder only observes one of the source streams. The coding technique that permits to achieve this is often referred to as "binning." In large source networks, binning can result in considerable savings in terms of encoding rate. The focus of this paper is on the scaling-law behavior, i.e., the characteristic performance in the limit as the source network size tends to infinity. For paradigmatic network topologies, we analyze the rate savings through binning, and we show that in some cases of interest, binning is scaling-law irrelevant.
{"title":"On The Significance Of Binning In A Scaling-law Sense","authors":"K. Eswaran, M. Gastpar","doi":"10.1109/ITW.2006.1633824","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633824","url":null,"abstract":"An efficient distributed source coding system with two encoders and dependent data streams must remove two kinds of redundancy: redundancy in each stream and between the two streams. The striking result of Slepian and Wolf showed that the latter can be eliminated even if each encoder only observes one of the source streams. The coding technique that permits to achieve this is often referred to as \"binning.\" In large source networks, binning can result in considerable savings in terms of encoding rate. The focus of this paper is on the scaling-law behavior, i.e., the characteristic performance in the limit as the source network size tends to infinity. For paradigmatic network topologies, we analyze the rate savings through binning, and we show that in some cases of interest, binning is scaling-law irrelevant.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122312881","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633794
Josep Cotrina Navau, Marcel Fernández, J. Casademont
In this paper we present constructions of traceability codes based on the Chinese Remainder Theorem. Taking into account the non-uniformity of the alphabet of the code, we derive a new expression for the minimum distance that allows us to provide a criterion to obtain traceability codes with the maximum number of code words. In order to make the traceability conditions as independent as possible of the code parameters, we also present a new family of non-uniform alphabet codes whose tracing capabilities only depend on the code length.
{"title":"Families of traceability codes based on the Chinese Remainder Theorem","authors":"Josep Cotrina Navau, Marcel Fernández, J. Casademont","doi":"10.1109/ITW.2006.1633794","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633794","url":null,"abstract":"In this paper we present constructions of traceability codes based on the Chinese Remainder Theorem. Taking into account the non-uniformity of the alphabet of the code, we derive a new expression for the minimum distance that allows us to provide a criterion to obtain traceability codes with the maximum number of code words. In order to make the traceability conditions as independent as possible of the code parameters, we also present a new family of non-uniform alphabet codes whose tracing capabilities only depend on the code length.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"386 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233460","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 : 2006-03-13DOI: 10.1109/ITW.2006.1633789
P. Jacquet
We show that the per node overhead of traffic control in a mobile ad hoc network with N nodes with density ν moving at average speed ν can be made proportional to √νNν). In this case route between source and destination has a bounded strectch factor compared to optimal route. Since by Gupta and Kumar scaling property the per node traffic cannot be larger than some O(1/log N). Therefore there is a maximal network size which depends of speed ν and node density. We show that we moderate hypotheses (location aware nodes) this size can be significantly large.
{"title":"Control of mobile ad hoc networks","authors":"P. Jacquet","doi":"10.1109/ITW.2006.1633789","DOIUrl":"https://doi.org/10.1109/ITW.2006.1633789","url":null,"abstract":"We show that the per node overhead of traffic control in a mobile ad hoc network with N nodes with density ν moving at average speed ν can be made proportional to √νNν). In this case route between source and destination has a bounded strectch factor compared to optimal route. Since by Gupta and Kumar scaling property the per node traffic cannot be larger than some O(1/log N). Therefore there is a maximal network size which depends of speed ν and node density. We show that we moderate hypotheses (location aware nodes) this size can be significantly large.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130731193","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
扫码关注我们
求助内容：
应助结果提醒方式：