Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261726
S. Miyake
For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix
{"title":"Lossy Data Compression over Zq by LDPC Code","authors":"S. Miyake","doi":"10.1109/ISIT.2006.261726","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261726","url":null,"abstract":"For cases other than the binary alphabet, we construct an LDPC code with the fidelity criterion for uniformly distributed sources on Z q, which asymptotically achieves the rate-distortion limit. For the existence of the LDPC code, we derive some conditions for the distortion criterion and for the parameters of the parity check matrix","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125225982","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-07-09DOI: 10.1109/ISIT.2006.261971
M. Cluzeau
In this paper, we present a new algorithm for recovering a linear block code from noisy codewords. To achieve this, we introduce a version of Gallager algorithm with weighted parity-check equations. This new algorithm efficiently recovers LDPC codes and can also be used for other block codes
{"title":"Block code reconstruction using iterative decoding techniques","authors":"M. Cluzeau","doi":"10.1109/ISIT.2006.261971","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261971","url":null,"abstract":"In this paper, we present a new algorithm for recovering a linear block code from noisy codewords. To achieve this, we introduce a version of Gallager algorithm with weighted parity-check equations. This new algorithm efficiently recovers LDPC codes and can also be used for other block codes","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110222","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-07-09DOI: 10.1109/ISIT.2006.261727
Xiaofu Wu, X. You, Chunming Zhao
The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth
{"title":"An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes","authors":"Xiaofu Wu, X. You, Chunming Zhao","doi":"10.1109/ISIT.2006.261727","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261727","url":null,"abstract":"The parity-check matrix of a quasi-cyclic code can be represented by a polynomial parity-check matrix with a significantly lower dimension. By using this compact representation, we can develop an efficient method for locating the girth of the quasi-cyclic code. The proposed girth-locating algorithm can be well employed to generate quasi-cyclic low-density parity-check codes with large girth","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"14 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120846523","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-07-09DOI: 10.1109/ISIT.2006.261802
Wei Wu, S. Vishwanath, A. Arapostathis
In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the transmitters. An achievable region and an outer bound are found for a discrete memoryless MAC that extend existing results, bringing together ideas from the two separate domains of MAC with state and MAC with feedback. Although this achievable region does not match the outer bound in general, non-trivial conditions are found where they meet. In the case of Gaussian MAC, a specialized achievable region is found by using a combination of dirty paper coding and a generalization of the Schalkwijk-Kailath (1966), Ozarow (1984) and Merhav-Weissman (2005) schemes, and this region is found to be capacity achieving. Specifically, it is shown that additive Gaussian interference that is known non-causally to the transmitter causes no loss in capacity for the Gaussian MAC with feedback
{"title":"Capacity Results for Multiple Access Channels with State and Feedback","authors":"Wei Wu, S. Vishwanath, A. Arapostathis","doi":"10.1109/ISIT.2006.261802","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261802","url":null,"abstract":"In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the transmitters. An achievable region and an outer bound are found for a discrete memoryless MAC that extend existing results, bringing together ideas from the two separate domains of MAC with state and MAC with feedback. Although this achievable region does not match the outer bound in general, non-trivial conditions are found where they meet. In the case of Gaussian MAC, a specialized achievable region is found by using a combination of dirty paper coding and a generalization of the Schalkwijk-Kailath (1966), Ozarow (1984) and Merhav-Weissman (2005) schemes, and this region is found to be capacity achieving. Specifically, it is shown that additive Gaussian interference that is known non-causally to the transmitter causes no loss in capacity for the Gaussian MAC with feedback","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"1990 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849128","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-07-09DOI: 10.1109/ISIT.2006.261984
M. Drmota, Y. Reznik, S. Savari, W. Szpankowski
We study the Tunstall code using the machinery from the analysis of algorithms literature. In particular, we propose an algebraic characterization of the Tunstall code which, together with tools like the Mellin transform and the Tauberian theorems, leads to new results on the variance and a central limit theorem for dictionary phrase lengths. This analysis also provides a new argument for obtaining asymptotic results about the mean dictionary phrase length and average redundancy rates
{"title":"Precise Asymptotic Analysis of the Tunstall Code","authors":"M. Drmota, Y. Reznik, S. Savari, W. Szpankowski","doi":"10.1109/ISIT.2006.261984","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261984","url":null,"abstract":"We study the Tunstall code using the machinery from the analysis of algorithms literature. In particular, we propose an algebraic characterization of the Tunstall code which, together with tools like the Mellin transform and the Tauberian theorems, leads to new results on the variance and a central limit theorem for dictionary phrase lengths. This analysis also provides a new argument for obtaining asymptotic results about the mean dictionary phrase length and average redundancy rates","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127088119","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-07-09DOI: 10.1109/ISIT.2006.261809
B. Wilson, M. Blaum
We consider a particular family of Gray codes having the property that codewords ci and ci+2 differ in a burst of length exactly two. These codes can be applied in the servo track-identification field to identify the correct track during seeks. We call these codes skew-tolerant Gray codes (STGC) and we present explicit constructions
{"title":"Skew-Tolerant Gray Codes","authors":"B. Wilson, M. Blaum","doi":"10.1109/ISIT.2006.261809","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261809","url":null,"abstract":"We consider a particular family of Gray codes having the property that codewords ci and ci+2 differ in a burst of length exactly two. These codes can be applied in the servo track-identification field to identify the correct track during seeks. We call these codes skew-tolerant Gray codes (STGC) and we present explicit constructions","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115522979","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-07-09DOI: 10.1109/ISIT.2006.262032
A. Schmeink, R. Mathar
The optimal power allocation for Gaussian vector channels subject to sum power constraints is achieved by the well known water-filling principle. In this correspondence, we show that the discontinuous water filling solution is obtained as the limiting case of p-norm bounds on the power covariance matrix as p tends to one. Directional derivatives are the main vehicle leading to this result. An easy graphical representation of the solution is derived by the level crossing points of simple power functions, which in the limit p = 1 gives a nice dual view of the classical representation
{"title":"Water-filling is the Limiting Case of a General Capacity Maximization Principle","authors":"A. Schmeink, R. Mathar","doi":"10.1109/ISIT.2006.262032","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262032","url":null,"abstract":"The optimal power allocation for Gaussian vector channels subject to sum power constraints is achieved by the well known water-filling principle. In this correspondence, we show that the discontinuous water filling solution is obtained as the limiting case of p-norm bounds on the power covariance matrix as p tends to one. Directional derivatives are the main vehicle leading to this result. An easy graphical representation of the solution is derived by the level crossing points of simple power functions, which in the limit p = 1 gives a nice dual view of the classical representation","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116033217","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-07-09DOI: 10.1109/ISIT.2006.261642
V. Mhatre, C. Rosenberg
The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet success probability is continuous. Hence, over each hop, for every finite SINR, there is a non-zero probability of packet loss. With this more realistic link model, it is shown that for a broad class of routing and scheduling schemes, a fixed fraction of hops on each route have a fixed non-zero packet loss probability. In a large network, a packet travels an asymptotically large number of hops from source to destination. Consequently, it is shown that the cumulative effect of per-hop packet loss results in a per-node throughput of only O (1/n) (instead of thetas[1/radic(n log n)] as shown previously for the threshold-based link model)
{"title":"The Impact of Link Layer Model on the Capacity of a Random Ad hoc Network","authors":"V. Mhatre, C. Rosenberg","doi":"10.1109/ISIT.2006.261642","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261642","url":null,"abstract":"The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet success probability is continuous. Hence, over each hop, for every finite SINR, there is a non-zero probability of packet loss. With this more realistic link model, it is shown that for a broad class of routing and scheduling schemes, a fixed fraction of hops on each route have a fixed non-zero packet loss probability. In a large network, a packet travels an asymptotically large number of hops from source to destination. Consequently, it is shown that the cumulative effect of per-hop packet loss results in a per-node throughput of only O (1/n) (instead of thetas[1/radic(n log n)] as shown previously for the threshold-based link model)","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116583681","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-07-09DOI: 10.1109/ISIT.2006.262035
Evangeline P. Bautista, P. Gaborit, Jon-Lark Kim, Judy L. Walker
Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths (only strongly conjectured for odd d) for which there exist s-extremal codes with 5 les d les 11, and give five s-extremal codes with d = 7 as well as four new s-extremal codes with d = 5. We also describe codes related to s-extremal codes
{"title":"s-Extremal Additive Codes over GF(4)","authors":"Evangeline P. Bautista, P. Gaborit, Jon-Lark Kim, Judy L. Walker","doi":"10.1109/ISIT.2006.262035","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262035","url":null,"abstract":"Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths (only strongly conjectured for odd d) for which there exist s-extremal codes with 5 les d les 11, and give five s-extremal codes with d = 7 as well as four new s-extremal codes with d = 5. We also describe codes related to s-extremal codes","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122323545","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-07-09DOI: 10.1109/ISIT.2006.261899
Ming Su, Lusheng Chen
Some properties of pn-periodic sequences over Fp with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of pn-periodic sequences over Fp is provided. The expectation of the 1-error linear complexity of random pn-periodic sequences over Fp is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a pn-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed
{"title":"The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp","authors":"Ming Su, Lusheng Chen","doi":"10.1109/ISIT.2006.261899","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261899","url":null,"abstract":"Some properties of p<sup>n</sup>-periodic sequences over F<sub>p </sub> with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of p<sup>n</sup>-periodic sequences over F<sub>p</sub> is provided. The expectation of the 1-error linear complexity of random p<sup>n</sup>-periodic sequences over F<sub>p</sub> is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a p<sup>n</sup>-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772801","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
扫码关注我们
求助内容：
应助结果提醒方式：