发布求助
文献互助 智能选刊 最新文献

2016 International Symposium on Information Theory and Its Applications (ISITA)最新文献

筛选
英文 中文
Decoding error of Sudoku for erasure channels 擦除信道数独解码错误
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSFUN.E100.A.2641
M. Nishiara, Ryo Hidai
{"title":"Decoding error of Sudoku for erasure channels","authors":"M. Nishiara, Ryo Hidai","doi":"10.1587/TRANSFUN.E100.A.2641","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E100.A.2641","url":null,"abstract":"Sudoku is a pencil puzzle. The aim of the solver is to complete the 9×9 grid by filling in a digit in every cell in a certain rule. In this study, we regard the process of solving Sudoku as a process of decoding a codeword from a received word, and show the expected decoding error probability obtained by experiments for erasure channels.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124259279","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}
引用次数: 0
Variable-length coding with cost allowing non-vanishing error probability 可变长度编码的代价允许不消失的错误概率
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/transfun.E100.A.1683
H. Yagi, R. Nomura
{"title":"Variable-length coding with cost allowing non-vanishing error probability","authors":"H. Yagi, R. Nomura","doi":"10.1587/transfun.E100.A.1683","DOIUrl":"https://doi.org/10.1587/transfun.E100.A.1683","url":null,"abstract":"We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ε. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate with a cost function is also the dominant set for a code attaining the minimum achievable rate with the other cost function. We also give a general formula of the second-order minimum achievable rate.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122292101","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}
引用次数: 5
Evaluation of overflow probability of Bayes code in moderate deviation regime 中等偏差状态下贝叶斯码溢出概率的评估
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSFUN.E100.A.2728
Shota Saito, T. Matsushima
{"title":"Evaluation of overflow probability of Bayes code in moderate deviation regime","authors":"Shota Saito, T. Matsushima","doi":"10.1587/TRANSFUN.E100.A.2728","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E100.A.2728","url":null,"abstract":"This paper treats the problem of lossless fixed-to-variable length source coding under the criterion of the overflow probability. We investigate the behavior of the overflow probability of the Bayes code in the moderate deviation regime. Our result clarifies that the behavior of the overflow probability of the Bayes code is the same as that of the optimal non-universal code in the moderate deviation regime.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116520750","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}
引用次数: 2
On zero error capacity of Nearest Neighbor Error channels with multilevel alphabet 多级字母最近邻误差信道的零误差容量研究
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/transfun.E100.A.2647
Takafumi Nakano, T. Wadayama
{"title":"On zero error capacity of Nearest Neighbor Error channels with multilevel alphabet","authors":"Takafumi Nakano, T. Wadayama","doi":"10.1587/transfun.E100.A.2647","DOIUrl":"https://doi.org/10.1587/transfun.E100.A.2647","url":null,"abstract":"This paper studies the zero error capacity of the Nearest Neighbor Error (NNE) channels with a multilevel alpha­bet. In the NNE channels, a transmitted sequence is a sequence of d-symbols belonging to the alphabet of size n. It is assumed that only one error to a nearest neighbor symbol in a transmitted sequence can occur. The NNE channels can be considered as a special type of limited magnitude error channels, and it is closely related to error models for flash memories. In this paper, we derive a lower bound of the zero error capacity of the NNE channels based on a result of the perfect Lee codes. An upper bound of the zero error capacity of the NNE channels is also derived from a feasible solution of an linear programming problem defined based on the confusion graphs of the NNE channels. As a result, a concise formula of the zero error capacity is obtained using the lower and upper bounds.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220661","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}
引用次数: 3
Error-trapping decoding for cyclic codes over symbol-pair read channels 符号对读信道上循环码的错误捕获解码
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSFUN.E100.A.2578
M. Morii, M. Hirotomo, Makoto Takita
{"title":"Error-trapping decoding for cyclic codes over symbol-pair read channels","authors":"M. Morii, M. Hirotomo, Makoto Takita","doi":"10.1587/TRANSFUN.E100.A.2578","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E100.A.2578","url":null,"abstract":"Symbol-pair read channels output overlapping pairs of symbols in storage applications. Pair distance and pair error are used in the channels. In this paper, we discuss the error-trapping decoding for cyclic codes over symbol-pair read channels. By putting some restrictions on the correctable pair error patterns, we discuss a new error-trapping decoding algorithm over the channels and show a circuitry for implementing the decoding algorithm. In addition, we discuss how to modify the restrictions on the correctable pair error patterns.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"60 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125566310","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}
引用次数: 13
Spatially “Mt. Fuji” coupled LDPC codes 空间上的“富士山”耦合LDPC码
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSFUN.E100.A.2594
Yuta Nakahara, Shota Saito, T. Matsushima
{"title":"Spatially “Mt. Fuji” coupled LDPC codes","authors":"Yuta Nakahara, Shota Saito, T. Matsushima","doi":"10.1587/TRANSFUN.E100.A.2594","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E100.A.2594","url":null,"abstract":"A new type of spatially coupled low density parity check (SCLDPC) codes is introduced. These codes have exponentially increasing nodes as position goes to the middle of the chain. We call the codes spatially \"Mt. Fuji\" coupled LDPC (SFCLDPC) codes because the shape constructed by the number of nodes looks like \"Mt. Fuji\". By this structure, the SFCLDPC codes have the rate loss O(α−L), while the usual SCLDPC codes have O(L−1). In addition, the decoding processes for the SFCLDPC codes are accelerated exponentially fast as the iteration progresses. An infinite length analysis for the SFCLDPC codes with the density evolution and a finite length performance comparison between the SFCLDPC codes and the SCLDPC codes with computer simulations are made.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124642040","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}
引用次数: 1
Correlational properties of the full-length sequences based on the discretized Markov transformations 基于离散马尔可夫变换的全长序列的相关性质
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/NOLTA.8.67
H. Fujisaki
{"title":"Correlational properties of the full-length sequences based on the discretized Markov transformations","authors":"H. Fujisaki","doi":"10.1587/NOLTA.8.67","DOIUrl":"https://doi.org/10.1587/NOLTA.8.67","url":null,"abstract":"We have previously defined the discretized Markov transformations and the full-length sequences based on such transformations. In view of basic properties of the normalized cross- and auto-correlation functions for the de Bruijn sequences that can be regarded as the full-length sequences based on the discretized dyadic transformation, we obtain correlational properties of the full-length sequences based on the discretized golden mean transformation. We generalize this result and give the correlational properties of the discretized Markov β-transformations with the alphabet Σ = {0,1, ···, k − 1} and the set F = {(k − 1)(k − 1)} of forbidden blocks (k ≥ 2), whose underlying transformations exhibit the most fundamental class of greedy β-expansions of real numbers.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134417204","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}
引用次数: 0
Private similarity searchable encryption for Euclidean distance 欧几里得距离的私有相似度可搜索加密
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSINF.2016INP0011
Yuji Unagami, Natsume Matsuzaki, Shota Yamada, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka
{"title":"Private similarity searchable encryption for Euclidean distance","authors":"Yuji Unagami, Natsume Matsuzaki, Shota Yamada, Nuttapong Attrapadung, Takahiro Matsuda, Goichiro Hanaoka","doi":"10.1587/TRANSINF.2016INP0011","DOIUrl":"https://doi.org/10.1587/TRANSINF.2016INP0011","url":null,"abstract":"In this paper, we propose a similarity searchable encryption in the symmetric key setting for Euclidean distance, by extending the functional encryption scheme for inner product proposed by Bishop et al. [2]. Our scheme performs predeter­mined encoding independently of vectors x and y, and it obtains the Euclidean distance between the two vectors while they remain encrypted.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134558874","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}
引用次数: 2
Tag-KEM/DEM framework for public-key encryption with non-interactive opening 标签- kem /DEM框架，用于非交互式开放的公钥加密
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSINF.2017ICP0003
Yusuke Sakai, Takahiro Matsuda, Goichiro Hanaoka
{"title":"Tag-KEM/DEM framework for public-key encryption with non-interactive opening","authors":"Yusuke Sakai, Takahiro Matsuda, Goichiro Hanaoka","doi":"10.1587/TRANSINF.2017ICP0003","DOIUrl":"https://doi.org/10.1587/TRANSINF.2017ICP0003","url":null,"abstract":"We present a Tag-KEM/DEM framework for public-key encryption with non-interactive opening. Using this framework we explain the idea behind an existing scheme, that is, we obtain some of such schemes as an instantiation of our framework. In addition, using our framework, we can obtain a scheme which can encrypt arbitrary-length plaintexts.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559373","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}
引用次数: 2
Signatures from trapdoor commitments with strong openings 来自活动门承诺的签名具有强大的开头
2016 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2016-10-01 DOI: 10.1587/TRANSFUN.E100.A.1924
Goichiro Hanaoka, Jacob C. N. Schuldt
{"title":"Signatures from trapdoor commitments with strong openings","authors":"Goichiro Hanaoka, Jacob C. N. Schuldt","doi":"10.1587/TRANSFUN.E100.A.1924","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E100.A.1924","url":null,"abstract":"In this paper, we propose a new generic construction of signatures from trapdoor commitments with strong openings in the random oracle model. Our construction is very efficient; signatures consist of just a single decommitment of the underlying commitment scheme. Furthermore, assuming the commitment scheme provides sufficiently strong statistical hiding and trapdoor opening properties, the reduction of the security of the signature scheme to the binding property of the commitment scheme is tight. To instantiate our construction, we propose two new commitment schemes with strong openings. Both of these are statistically hiding, and have binding properties based on a Diffie-Hellman inversion problem and factoring, respectively. The signature schemes obtained from these are very efficient; the first matches the performance of BLS signatures, which currently pro­vides the shortest signatures, and the second provides signatures which is one bit shorter than the shortest version of Rabin-Williams signatures while still being tightly related to factoring.","PeriodicalId":278189,"journal":{"name":"2016 International Symposium on Information Theory and Its Applications (ISITA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115399622","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信