Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365297
J. Weber, M. Fossorier
The chase decoding algorithms are reliability-based algorithms achieving bounded-distance (BD) decoding for any binary linear code of Hamming distance d. The least complex version of the original chase algorithms ("Chase-3") uses O(d) trials of a conventional binary decoder. In this paper, we propose a class of Chase-like BD decoding algorithms of lower complexity than the original Chase-3 algorithm. In particular, the least complex member of this class requires only O(d/sup 2/3/) trials.
{"title":"Limited-trial chase-like bounded-distance decoding","authors":"J. Weber, M. Fossorier","doi":"10.1109/ISIT.2004.1365297","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365297","url":null,"abstract":"The chase decoding algorithms are reliability-based algorithms achieving bounded-distance (BD) decoding for any binary linear code of Hamming distance d. The least complex version of the original chase algorithms (\"Chase-3\") uses O(d) trials of a conventional binary decoder. In this paper, we propose a class of Chase-like BD decoding algorithms of lower complexity than the original Chase-3 algorithm. In particular, the least complex member of this class requires only O(d/sup 2/3/) trials.","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":"128521727","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365464
Ilju Na, D. Neuhoff
The performance of frog-in-the box (FIB) code index assignments is numerically investigated when maximum likelihood (ML) decoding is used in place of optimal MMSE decoding. Specifically, the reproduction levels are chosen to be those that would be used for a noiseless channel, and the decoder simply maps the channel output to a level whose index codeword is closest to the channel output.
{"title":"Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantization","authors":"Ilju Na, D. Neuhoff","doi":"10.1109/ISIT.2004.1365464","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365464","url":null,"abstract":"The performance of frog-in-the box (FIB) code index assignments is numerically investigated when maximum likelihood (ML) decoding is used in place of optimal MMSE decoding. Specifically, the reproduction levels are chosen to be those that would be used for a noiseless channel, and the decoder simply maps the channel output to a level whose index codeword is closest to the channel output.","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":"128544117","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365472
A. Kapur, M. Varanasi
The max-min fairness idea is applied to optimize the CDMA capacity region. For any given signal set, a fair rate-allocation algorithm is specified. The notion of fair capacity is introduced and a signal design algorithm is proposed that produces signal sets with near-maximum fair capacity under (a) optimum decoding and (b) suboptimal decoding based on MMSE filtering and successive decoding, when there is sufficient bandwidth.
{"title":"A max-min fair approach to optimize the CDMA capacity region","authors":"A. Kapur, M. Varanasi","doi":"10.1109/ISIT.2004.1365472","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365472","url":null,"abstract":"The max-min fairness idea is applied to optimize the CDMA capacity region. For any given signal set, a fair rate-allocation algorithm is specified. The notion of fair capacity is introduced and a signal design algorithm is proposed that produces signal sets with near-maximum fair capacity under (a) optimum decoding and (b) suboptimal decoding based on MMSE filtering and successive decoding, when there is sufficient bandwidth.","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":"128670307","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365160
Y. Xin, I. Fair
This paper investigate the extension of Golay complementary sequences to a larger family of sequences which we call multiple L-shift complementary sequences ( L 2 I ). It is well-known that the peak-to-average power ratio (PAPR) value of any Golay complementary sequence is less than or equal to 2. We show that the PAPR of each multiple L-shift complementary sequence is less than or equal to 2L. Other properties of multiple L-shift complementary sequences are also discussed.
{"title":"Multiple-shift complementary sequences and their peak-to-average power ratio values","authors":"Y. Xin, I. Fair","doi":"10.1109/ISIT.2004.1365160","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365160","url":null,"abstract":"This paper investigate the extension of Golay complementary sequences to a larger family of sequences which we call multiple L-shift complementary sequences ( L 2 I ). It is well-known that the peak-to-average power ratio (PAPR) value of any Golay complementary sequence is less than or equal to 2. We show that the PAPR of each multiple L-shift complementary sequence is less than or equal to 2L. Other properties of multiple L-shift complementary sequences are 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":"129337688","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365199
S. Forchhammer
A method for designing quasistationary probability measures for two-dimensional (2-D) constraints is presented. This measure is derived from a modified bit-stuff coding scheme and it gives the capacity of the coding scheme. This provides a constructive lower bound on the capacity of the 2-D constraint. The main examples are checkerboard codes with binary elements. The capacity for one instance of the modified bit-stuffing for the 2-D runlength-limited RLL(2,/spl infin/) constraint is calculated to be 0.4414 bits/symbol. For the constraint given by a minimum (1-norm) distance of 3 between 1s a code with capacity 0.3497 bits/symbol is given.
{"title":"Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures","authors":"S. Forchhammer","doi":"10.1109/ISIT.2004.1365199","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365199","url":null,"abstract":"A method for designing quasistationary probability measures for two-dimensional (2-D) constraints is presented. This measure is derived from a modified bit-stuff coding scheme and it gives the capacity of the coding scheme. This provides a constructive lower bound on the capacity of the 2-D constraint. The main examples are checkerboard codes with binary elements. The capacity for one instance of the modified bit-stuffing for the 2-D runlength-limited RLL(2,/spl infin/) constraint is calculated to be 0.4414 bits/symbol. For the constraint given by a minimum (1-norm) distance of 3 between 1s a code with capacity 0.3497 bits/symbol is given.","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":"130028758","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365119
C. Florens, M. Sharif, R. McEliece
This paper presents the data collection function in sensory networks. Specifically we derive relationships between data collection time and transmission range, data packet size and channel noise in the simple line scenario. To develop intuition these relationships are studied in the limit case where the number of sensor nodes becomes large.
{"title":"Delay issues in linear sensory networks","authors":"C. Florens, M. Sharif, R. McEliece","doi":"10.1109/ISIT.2004.1365119","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365119","url":null,"abstract":"This paper presents the data collection function in sensory networks. Specifically we derive relationships between data collection time and transmission range, data packet size and channel noise in the simple line scenario. To develop intuition these relationships are studied in the limit case where the number of sensor nodes becomes large.","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":"130057861","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365597
T. Linder, R. Zamir
In causal source coding, the reconstruction is restricted to be a function of the present and past source samples, while the variable-length code stream may be noncausal. Neuhoff and Gilbert [1982] showed that for memoryless sources, optimum performance among all causal lossy source codes is achieved by time-sharing at most two memoryless codes (scalar quantizers) followed by entropy coding. We extend this result to causal coding of individual sequences in the limit of small distortion. The optimum performance of finite-memory variable-rate causal codes in this setting is characterized by a deterministic analogue of differential entropy, which we call "Lempel-Ziv differential entropy." As a by-product, we also provide an individual-sequence version of the Shannon lower bound to the rate-distortion function.
{"title":"Causal coding of individual sequences and the Lempel-Ziv differential entropy","authors":"T. Linder, R. Zamir","doi":"10.1109/ISIT.2004.1365597","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365597","url":null,"abstract":"In causal source coding, the reconstruction is restricted to be a function of the present and past source samples, while the variable-length code stream may be noncausal. Neuhoff and Gilbert [1982] showed that for memoryless sources, optimum performance among all causal lossy source codes is achieved by time-sharing at most two memoryless codes (scalar quantizers) followed by entropy coding. We extend this result to causal coding of individual sequences in the limit of small distortion. The optimum performance of finite-memory variable-rate causal codes in this setting is characterized by a deterministic analogue of differential entropy, which we call \"Lempel-Ziv differential entropy.\" As a by-product, we also provide an individual-sequence version of the Shannon lower bound to the rate-distortion function.","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":"131059585","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365556
S. Vijayakumaran, Y. Levinbook, T. Wong
The problem of estimating the location and time of origin of an instantaneous source of a particular gas using a simple sensor network is investigated in this paper. Here, the gas spreads by diffusion and the sensors make a binary decision on the existence of the gas by measuring its concentration in their immediate vicinity. The inability of the sensors to go beyond a binary resolution of the concentration justifies their classification as dumb. In this paper, it is restricted to the one-dimensional case where the sensors form a linear array. The analysis of the Cramer-Rao bound (CRB) to study the limits of estimation performance is numerically calculated. Based on the number of gas molecules the Poisson distribution by a Gaussian distribution with mean and variance is approximated.
{"title":"On diffusive source localization using dumb sensors","authors":"S. Vijayakumaran, Y. Levinbook, T. Wong","doi":"10.1109/ISIT.2004.1365556","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365556","url":null,"abstract":"The problem of estimating the location and time of origin of an instantaneous source of a particular gas using a simple sensor network is investigated in this paper. Here, the gas spreads by diffusion and the sensors make a binary decision on the existence of the gas by measuring its concentration in their immediate vicinity. The inability of the sensors to go beyond a binary resolution of the concentration justifies their classification as dumb. In this paper, it is restricted to the one-dimensional case where the sensors form a linear array. The analysis of the Cramer-Rao bound (CRB) to study the limits of estimation performance is numerically calculated. Based on the number of gas molecules the Poisson distribution by a Gaussian distribution with mean and variance is approximated.","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":"131885301","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365370
J. Nayak, E. Tuncel, K. Rose
A basic problem in information theory is source coding under a distortion constraint when the decoder has side-information about the source. In this paper the problem of variable length coding of a memoryless source under a maximum distortion constraint when there is side-information solely at the decoder is focused. Using a combinatorial approach, a nonsingle-letter expression for the minimum asymptotic average rate as well as single-letter bounds on this rate is derived
{"title":"Lossy source coding under a maximum distortion constraint with decoder side-information","authors":"J. Nayak, E. Tuncel, K. Rose","doi":"10.1109/ISIT.2004.1365370","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365370","url":null,"abstract":"A basic problem in information theory is source coding under a distortion constraint when the decoder has side-information about the source. In this paper the problem of variable length coding of a memoryless source under a maximum distortion constraint when there is side-information solely at the decoder is focused. Using a combinatorial approach, a nonsingle-letter expression for the minimum asymptotic average rate as well as single-letter bounds on this rate is derived","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":"131937102","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365068
E. Ordentlich, M. Weinberger
Given two probability distributions Q and P, let /spl par/Q-P/spl par//sub 1/ and D(Q/spl par/P), respectively, denote the L/sub 1/ distance and divergence between Q and P. We derive a refinement of Pinsker's inequality of the form D(Q/spl par/P)/spl ges//spl phi/(P)/spl par/Q-P/spl par//sub 1//sup 2/ and characterize the best P-dependent factor /spl phi/(P).
{"title":"A distribution dependent refinement of Pinsker's inequality","authors":"E. Ordentlich, M. Weinberger","doi":"10.1109/ISIT.2004.1365068","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365068","url":null,"abstract":"Given two probability distributions Q and P, let /spl par/Q-P/spl par//sub 1/ and D(Q/spl par/P), respectively, denote the L/sub 1/ distance and divergence between Q and P. We derive a refinement of Pinsker's inequality of the form D(Q/spl par/P)/spl ges//spl phi/(P)/spl par/Q-P/spl par//sub 1//sup 2/ and characterize the best P-dependent factor /spl phi/(P).","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":"132154570","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
扫码关注我们
求助内容：
应助结果提醒方式：