Pub Date : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174282
P. Trifonov
Recursive trellis decoding of polar codes is considered. Polar codes are shown to have much lower recursive trellis decoding complexity compared to similar Reed-Muller codes. Furthermore, a low-latency decoding algorithm, which combines recursive trellis and successive cancellation decoding methods, is presented.
{"title":"Recursive Trellis Decoding Techniques of Polar Codes","authors":"P. Trifonov","doi":"10.1109/ISIT44484.2020.9174282","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174282","url":null,"abstract":"Recursive trellis decoding of polar codes is considered. Polar codes are shown to have much lower recursive trellis decoding complexity compared to similar Reed-Muller codes. Furthermore, a low-latency decoding algorithm, which combines recursive trellis and successive cancellation decoding methods, is presented.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777905","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174389
Ajaykrishnan Nageswaran, P. Narayan
A user generates n independent and identically distributed data random variables with a probability mass function that must be guarded from a querier. The querier must recover, with a prescribed accuracy, a given function of the data from each of n independent and identically distributed user-devised query responses. The user chooses the data pmf and the random query responses to maximize distribution privacy as gauged by the divergence between the pmf and the querier's best estimate of it based on the n query responses. A general lower bound is provided for distribution privacy; and, for the case of binaryvalued functions, upper and lower bounds that converge to said bound as n grows. Explicit strategies for the user and querier are identified.
{"title":"Distribution Privacy Under Function Recoverability","authors":"Ajaykrishnan Nageswaran, P. Narayan","doi":"10.1109/ISIT44484.2020.9174389","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174389","url":null,"abstract":"A user generates n independent and identically distributed data random variables with a probability mass function that must be guarded from a querier. The querier must recover, with a prescribed accuracy, a given function of the data from each of n independent and identically distributed user-devised query responses. The user chooses the data pmf and the random query responses to maximize distribution privacy as gauged by the divergence between the pmf and the querier's best estimate of it based on the n query responses. A general lower bound is provided for distribution privacy; and, for the case of binaryvalued functions, upper and lower bounds that converge to said bound as n grows. Explicit strategies for the user and querier are identified.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632022","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9173982
Hirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, K. Iwata
In the entropy coding, AIVF (almost instantaneous variable-to-fixed length) codes using multiple parsing trees can attain a better compression rate than the Tunstall code, which attains the best compression rate in the class of VF codes with a single parsing tree. Furthermore, the multiple parsing trees of an AIVF code can be multiplexed into a single parsing tree. In this paper, we propose a new universal data compression code based on the techniques of the AIVF code. The proposed universal code can also be considered as an improvement of the LZW code (Welch code). We explain how the AIVF coding techniques can be applied to universal coding by growing dynamically a single parsing tree, and we evaluate the compression rate of the proposed universal code theoretically and using several corpora.
{"title":"A Universal Data Compression Scheme based on the AIVF Coding Techniques","authors":"Hirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, K. Iwata","doi":"10.1109/ISIT44484.2020.9173982","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9173982","url":null,"abstract":"In the entropy coding, AIVF (almost instantaneous variable-to-fixed length) codes using multiple parsing trees can attain a better compression rate than the Tunstall code, which attains the best compression rate in the class of VF codes with a single parsing tree. Furthermore, the multiple parsing trees of an AIVF code can be multiplexed into a single parsing tree. In this paper, we propose a new universal data compression code based on the techniques of the AIVF code. The proposed universal code can also be considered as an improvement of the LZW code (Welch code). We explain how the AIVF coding techniques can be applied to universal coding by growing dynamically a single parsing tree, and we evaluate the compression rate of the proposed universal code theoretically and using several corpora.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124958109","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9173977
Roni Con, Amir Shpilka
In the binary deletion channel with parameter p (BDCp) every bit is deleted independently with probability p. [1] proved a lower bound of (1−p)/9 on the capacity of the BDCp, yet currently no explicit construction achieves this rate. In this work we give an explicit family of codes of rate (1 −p)/16, for every p. This improves upon the work of Guruswami and Li [2] that gave a construction of rate (1−p)/120. The codes in our family have polynomial time encoding and decoding algorithms.
{"title":"Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel","authors":"Roni Con, Amir Shpilka","doi":"10.1109/ISIT44484.2020.9173977","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9173977","url":null,"abstract":"In the binary deletion channel with parameter p (BDCp) every bit is deleted independently with probability p. [1] proved a lower bound of (1−p)/9 on the capacity of the BDCp, yet currently no explicit construction achieves this rate. In this work we give an explicit family of codes of rate (1 −p)/16, for every p. This improves upon the work of Guruswami and Li [2] that gave a construction of rate (1−p)/120. The codes in our family have polynomial time encoding and decoding algorithms.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124561540","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174108
Fatemeh Hosseinigoki, O. Kosut
This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.
{"title":"Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel","authors":"Fatemeh Hosseinigoki, O. Kosut","doi":"10.1109/ISIT44484.2020.9174108","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174108","url":null,"abstract":"This paper considers the two-user Gaussian arbitrarily-varying broadcast channel, wherein a power-limited transmitter wishes to send a message to each of two receivers. Each receiver sees a superposition of the transmitter's sequence, Gaussian noise, and a signal from a power-limited malicious jammer. The jammer is assumed to know the code, but is oblivious to real-time transmissions. The exact capacity region of this setting is determined to be the capacity region of the standard Gaussian broadcast channel, but with the noise variance increased by the power of the jammer, as long as the received power of the jammer at each receiver is less than that of the legitimate transmitter. A key aspect of the achievable scheme involves sharing randomness from the transmitter to the receivers by breaking the transmitted sequence into segments, and either transmitting at full power in a segment, or sending zero. By coding over the on/off signal, a small shared randomness can be established without corruption by the jammer, and without interfering with the standard superposition coding strategy for the Gaussian broadcast channel.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125249822","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174396
Sourya Basu, Daewon Seo, L. Varshney
We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.
{"title":"Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion","authors":"Sourya Basu, Daewon Seo, L. Varshney","doi":"10.1109/ISIT44484.2020.9174396","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174396","url":null,"abstract":"We consider two problems in multiterminal source coding under maximal distortion: distributed coding for computing and successive refinement. In distributed coding for computing, we propose a hypergraph-based coding scheme which matches the sum-rate bound of the Berger-Tung inner bound. Further, this scheme matches the entire Berger-Tung inner region when the sources are independent and it outperforms existing graph-based coding schemes. For successive refinement, we propose a hypergraph-based scheme that attains the entire rate region.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123332417","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174173
Aditya Narayan Ravi, S. R. Pillai, V. Prabhakaran, M. Wigger
Feedback is known to enlarge the capacity region of a Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers, and an average power constraint at the transmitter. The capacity enlargement may occur even when there is noisy feedback from only one of the two receivers. However, recent results show the existence of a feedback noise threshold, beyond which one-sided feedback from only the stronger receiver is futile in enlarging the capacity region. The current paper presents a tight characterization of the feedback noise threshold, which separates the regimes where feedback from only the stronger receiver enlarges the capacity or leaves it unchanged. The scheme used to prove this result also leads to some interesting observations on noisy feedback from only the weak receiver.
{"title":"When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel?","authors":"Aditya Narayan Ravi, S. R. Pillai, V. Prabhakaran, M. Wigger","doi":"10.1109/ISIT44484.2020.9174173","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174173","url":null,"abstract":"Feedback is known to enlarge the capacity region of a Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers, and an average power constraint at the transmitter. The capacity enlargement may occur even when there is noisy feedback from only one of the two receivers. However, recent results show the existence of a feedback noise threshold, beyond which one-sided feedback from only the stronger receiver is futile in enlarging the capacity region. The current paper presents a tight characterization of the feedback noise threshold, which separates the regimes where feedback from only the stronger receiver enlarges the capacity or leaves it unchanged. The scheme used to prove this result also leads to some interesting observations on noisy feedback from only the weak receiver.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128873818","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174360
Mark Sinzger, Maximilian Gehri, H. Koeppl
A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by exploiting the link with filtering theory. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFF-favoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ON-favoring local optima.
{"title":"Poisson channel with binary Markov input and average sojourn time constraint","authors":"Mark Sinzger, Maximilian Gehri, H. Koeppl","doi":"10.1109/ISIT44484.2020.9174360","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174360","url":null,"abstract":"A minimal model for gene expression, consisting of a switchable promoter together with the resulting messenger RNA, is equivalent to a Poisson channel with a binary Markovian input process. Determining its capacity is an optimization problem with respect to two parameters: the average sojourn times of the promoter’s active (ON) and inactive (OFF) state. An expression for the mutual information is found by exploiting the link with filtering theory. For fixed peak power, three bandwidth-like constraints are imposed by lower-bounding (i) the average sojourn times (ii) the autocorrelation time and (iii) the average time until a transition. OFF-favoring optima are found for all three constraints, as commonly encountered for the Poisson channel. In addition, constraint (i) exhibits a region that favors the ON state, and (iii) shows ON-favoring local optima.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755752","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174258
Jiongyue Xing, M. Bossert, Sebastian Bitzer, Li Chen
This paper proposes a novel shift-sum decoding scheme for non-binary cyclic codes. Using minimum-weight dual codewords and their cyclic shifts, a reliability measure can be yielded as an indicator for the error position and the error magnitude. Based on this shift-sum decoding concept, a harddecision iterative decoding algorithm is proposed, which can correct errors beyond half of the code’s minimum Hamming distance. By utilizing reliability information from the channel, a soft-decision iterative decoding algorithm is further introduced to improve the decoding performance. These two shift-sum based iterative decoding algorithms are realized with polynomial multiplication and integer (or real number) comparisons, which are hardware-friendly. Simulation results on Reed-Solomon codes and non-binary BCH codes show the decoding potential of the proposed algorithms.
{"title":"Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords","authors":"Jiongyue Xing, M. Bossert, Sebastian Bitzer, Li Chen","doi":"10.1109/ISIT44484.2020.9174258","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174258","url":null,"abstract":"This paper proposes a novel shift-sum decoding scheme for non-binary cyclic codes. Using minimum-weight dual codewords and their cyclic shifts, a reliability measure can be yielded as an indicator for the error position and the error magnitude. Based on this shift-sum decoding concept, a harddecision iterative decoding algorithm is proposed, which can correct errors beyond half of the code’s minimum Hamming distance. By utilizing reliability information from the channel, a soft-decision iterative decoding algorithm is further introduced to improve the decoding performance. These two shift-sum based iterative decoding algorithms are realized with polynomial multiplication and integer (or real number) comparisons, which are hardware-friendly. Simulation results on Reed-Solomon codes and non-binary BCH codes show the decoding potential of the proposed algorithms.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131034096","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 : 2020-06-01DOI: 10.1109/ISIT44484.2020.9174235
Anna Frank
For streaming applications, we consider parallel burst erasure channels in the presence of an eavesdropper. The legitimate receiver must perfectly recover each source symbol subject to a decoding delay constraint without the eavesdropper gaining any information from his observation. For a certain class of code parameters, we propose delay-optimal M-link codes that recover multiple bursts of erasures of a limited length, and where the codes provide perfect security even if the eavesdropper can observe a link of his choice. Our codes achieve the maximum secrecy rate for the channel model.
{"title":"Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an Eavesdropper","authors":"Anna Frank","doi":"10.1109/ISIT44484.2020.9174235","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174235","url":null,"abstract":"For streaming applications, we consider parallel burst erasure channels in the presence of an eavesdropper. The legitimate receiver must perfectly recover each source symbol subject to a decoding delay constraint without the eavesdropper gaining any information from his observation. For a certain class of code parameters, we propose delay-optimal M-link codes that recover multiple bursts of erasures of a limited length, and where the codes provide perfect security even if the eavesdropper can observe a link of his choice. Our codes achieve the maximum secrecy rate for the channel model.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137381","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
扫码关注我们
求助内容：
应助结果提醒方式：