default search action
ISITA 2016: Monterey, CA, USA
- 2016 International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, CA, USA, October 30 - November 2, 2016. IEEE 2016, ISBN 978-4-88552-309-0
- Shota Saito, Toshiyasu Matsushima:
Evaluation of overflow probability of Bayes code in moderate deviation regime. 1-5 - Mitsuharu Arimura, Hiroshi Nagaoka:
A two-step universal VV code using an asymptotically sufficient statistic extracted from a VF code. 6-10 - Junya Honda, Hirosuke Yamamoto:
Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias code. 11-15 - Hideki Yagi, Ryo Nomura:
Variable-length coding with cost allowing non-vanishing error probability. 16-20 - Shota Saito, Toshiyasu Matsushima:
Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. 21-25 - Mohammad Mohammadi Amiri, Deniz Gündüz:
Improved delivery rate-cache capacity trade-off for centralized coded caching. 26-30 - Takahiro Yoshida, Toshiyasu Matsushima:
Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codes. 31-35 - Jung-Hyun Kim, Mi-Young Nam, Hong-Yeop Song:
Alphabet-dependent upper bounds for locally repairable codes with joint locality. 36-40 - Akira Kamatsuka, Yuta Azuma, Takahiro Yoshida, Toshiyasu Matsushima:
Regenerating codes with generalized conditions of reconstruction and regeneration. 41-45 - Gokhan Calis, Onur Ozan Koyluoglu:
On the maintenance of distributed storage systems with backup node for repair. 46-50 - Takahiro Ota, Akiko Manada, Hiroyoshi Morita:
A finite graph representation for two-dimensional finite type constrained systems. 51-55 - Tadahiro Kitazono, Kazushi Mimura:
Upper bounds for the number of solutions to spatially coupled Sudokus. 56-60 - Mikihiko Nishiara, Ryo Hidai:
Decoding error of Sudoku for erasure channels. 61-65 - Takafumi Nakano, Tadashi Wadayama:
On zero error capacity of Nearest Neighbor Error channels with multilevel alphabet. 66-70 - Takahiro Ota, Akiko Manada, Hiroyoshi Morita:
A two-dimensional antidictionary automaton for a toric surface. 71-75 - Shingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi:
A construction of attribute-based aggregate signatures. 76-80 - Goichiro Hanaoka, Jacob C. N. Schuldt:
Signatures from trapdoor commitments with strong openings. 81-85 - Shogo Kimura, Kazuki Yoneyama:
Security proof of identity-based signature under RSA assumption, reconsidered. 86-90 - Goichiro Hanaoka, Jacob C. N. Schuldt:
On signatures with tight security in the multi-user setting. 91-95 - Masayuki Fukumitsu, Shingo Hasegawa:
A generic construction of tight security signatures in the non-programmable random oracle model. 96-100 - Chao He, Sheng Yang, Pablo Piantanida:
A non-linear transmission scheme for the K-user broadcast channel with state feedback. 101-105 - Stefan Farthofer, Gerald Matz:
Linear superposition coding for the Gaussian broadcast channel with quantized feedback. 106-110 - Guangyue Han, Tao Liu:
ARMA(1) Gaussian feedback capacity revisited. 111-115 - Hisashi Koga, Yuji Nakajima, Takahisa Toda:
Effective construction of compression-based feature space. 116-120 - Masayuki Goto, Manabu Kobayashi, Kenta Mikawa, Shigeichi Hirasawa:
A Bayes prediction algorithm for model class composed of several subclasses. 121-125 - Yasutaka Hatakeyama, Takahiro Ogawa, Hirokazu Tanaka, Miki Haseyama:
An accurate mortality prediction method based on decision-level fusion of existing ICU scoring systems. 126-130 - Tomoharu Shibuya, Takeru Sudo:
Construction and analysis of rank-modulation rewriting codes by the group of permutation matrices. 131-135 - Akira Yamawaki, Hiroshi Kamabe:
Maximization of average number of rewriting of ILIFC with inversion operation. 136-140 - Yoju Fujino, Tadashi Wadayama:
A construction of non-binary WOM codes based on integer programming. 141-145 - Naoki Shibayama, Toshinobu Kaneko:
A new higher order differential of DBlock. 146-150 - Nobuyuki Sugio, Yasutaka Igarashi, Toshinobu Kaneko:
Integral characteristics of MISTY2 derived by division property. 151-155 - Takaya Miyano, Kenichiro Cho:
Chaos-based one-time pad cryptography. 156-160 - Shigeaki Kuzuoka:
Variable-length coding for mixed sources with side information allowing decoding errors. 161-165 - Salman Salamatian, Asaf Cohen, Muriel Médard:
Efficient coding for multi-source networks using Gács-Körner common information. 166-170 - Yasutada Oohama:
Exponent function for Wyner-Ziv source coding problem at rates below the rate distortion function. 171-175 - Jun Muramatsu, Shigeki Miyake:
Construction of a channel code from an arbitrary source code with decoder side information. 176-180 - Kenji Ueda, Akira Nakamura, Makoto Itami, Kohji Itoh:
Path estimation for multi-carrier CDMA system with two-way path-adapted array antennas. 181-185 - Chia-Fu Chang, Yen-Ching Liu, Meng-Hsun Yu, Mao-Chao Lin:
A joint design of timing tracking and channel estimation for IDMA receivers. 186-190 - Takatoshi Sakaguchi, Kengo Shibata, Wei Hou, Masakazu Yoshida, Jun Cheng:
Performance analysis of SC-RA coded IDMA systems with segmented interleavers. 191-195 - Ehsan Moeen Taghavi, Mostafa Monemizadeh, Sajjad Bahrami, Ghosheh Abed Hodtani:
An energy efficient coding scheme for the multiple access relay channel. 196-200 - Yuta Nakahara, Shota Saito, Toshiyasu Matsushima:
Spatially "Mt. Fuji" coupled LDPC codes. 201-205 - Allison Beemer, Christine A. Kelley:
Avoiding trapping sets in SC-LDPC codes under windowed decoding. 206-210 - Shingo Asakura, Makoto Tanahashi, Madoka Nakamura, Masahiro Okano, Kenichi Tsuchida:
Hardware implementation of spatially coupled LDPC codes for broadcasting. 211-215 - Kengo Shibata, Masakazu Yoshida, Jun Cheng:
Spatially-coupled irregular LDPC codes by non-square superposition matrices. 216-220 - Tatsuki Miyamoto, Yasuyuki Murakami:
An implementation of hybrid-type inter-organization cryptosystem using ElGamal PKC. 221-225 - Yutaka Kawai:
Master key updatable attribute-based encryption on the dual pairing vector space. 226-230 - Yusuke Sakai, Takahiro Matsuda, Goichiro Hanaoka:
Tag-KEM/DEM framework for public-key encryption with non-interactive opening. 231-235 - Atsushi Takayasu, Noboru Kunihiro:
Small secret exponent attacks on RSA with unbalanced prime factors. 236-240 - En-Hui Yang, Jingyun Bian:
Bipartite grammar-based representations of large sparse binary matrices: Framework and transforms. 241-245 - Mitsuharu Arimura:
A grammar-based compression using a variation of Chomsky normal form of context free grammar. 246-250 - Anh Thu Phan Ho, Wadih Sawaya, Patrick Bas:
Rare event probability estimation using information projection. 251-255 - Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax rate-optimal estimation of KL divergence between discrete distributions. 256-260 - Inseon Kim, Ki-Hyeon Park, Min Kyu Song, Hong-Yeop Song, Jang Yong Lee:
Design of LPI signals using optimal families of perfect polyphase sequences. 261-264 - Thach V. Bui, Tetsuya Kojima, Isao Echizen:
Efficiently decodable defective items detected by new model of noisy group testing. 265-269 - Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
A note on support recovery of sparse signals using linear programming. 270-274 - Jennifer B. Erway, Robert J. Plemmons, Lasith Adhikari, Roummel F. Marcia:
Trust-region methods for nonconvex sparse recovery optimization. 275-279 - Lasith Adhikari, Arnold D. Kim, Roummel F. Marcia:
Nonconvex sparse poisson intensity reconstruction for time-dependent bioluminescence tomography. 280-284 - Kenta Mikawa, Manabu Kobayashi, Masayuki Goto, Shigeichi Hirasawa:
Distance metric learning based on different ℓ1 regularized metric matrices in each category. 285-289 - Igor V. Zhilin, Alexey Kreschuk, Victor V. Zyablov:
Generalized concatenated codes with soft decoding of inner and outer codes. 290-294 - Thomas Mittelholzer, Thomas P. Parnell, Nikolaos Papandreou, Haralampos Pozidis:
Improving the error-floor performance of binary half-product codes. 295-299 - Shohei Fujimoto, Takuya Kusaka, Shunsuke Ueda:
A study on soft-out of soft-in/soft-out decoding algorithms for binary linear codes. 300-304 - Li Chen, Martin Bossert:
Algebraic chase decoding of Reed-Solomon codes using module minimisation. 305-309 - Hiroya Takahashi, Kanayo Ogura, Bhed Bahadur Bista, Toyoo Takata:
A user authentication scheme using keystrokes for smartphones while moving. 310-314 - Takato Hirano, Takashi Ito, Yutaka Kawai, Nori Matsuda, Takumi Yamamoto, Tatsuji Munaka:
A practical attack to AINA2014's countermeasure for cancelable biometric authentication protocols. 315-319 - Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth:
On a variant of multilinear modular hashing with applications to authentication and secrecy codes. 320-324 - SeongHan Shin, Kazukuni Kobara:
A secure anonymous password-based authentication protocol with control of authentication numbers. 325-329 - Ryosuke Kobayashi, Rie Shigetomi Yamaguchi:
One hour term authentication for Wi-Fi information captured by smartphone sensors. 330-334 - Kan Kamada, Tetsuya Kojima, Udaya Parampalli:
Tone code: A novel method for covert communications based on musical components. 335-339 - Wataru Nakamura, Hirosuke Yamamoto, Terence Chan:
A ramp threshold secret sharing scheme against cheating by substitution attacks. 340-344 - Shota Kamiya, Hiroki Koga:
New fundamental properties on a secret-key cryptosystem under guessing secrecy criteria. 345-349 - Yanling Chen, Onur Ozan Koyluoglu, A. J. Han Vinck:
On secure communication over the multiple access channel. 350-354 - Zarrin Montazeri, Amir Houmansadr, Hossein Pishro-Nik:
Achieving perfect location privacy in Markov models using anonymization. 355-359 - Takahiro Yokomori, Masahiro Fujii, Hiroyuki Hatano, Atsushi Ito, Yu Watanabe:
An improvement of media access control scheme for inter-vehicle communications. 360-364 - Kento Takabayashi, Hirokazu Tanaka, Chika Sugimoto, Ryuji Kohno:
Performance evaluation of error control scheme in multihop WBAN based on IEEE802.15.6. 365-369 - Kanako Yamaguchi, Nicolas Gresset, Hiroshi Nishimoto, Akihiro Okazaki, Shusaku Umeda, Kaoru Tsukamoto, Hiroyasu Sano, Atsushi Okamura:
Two-dimensional diversity with serial concatenation of spectral precoding and DSTBC. 370-374 - Takuma Yamagishi, Toshiki Mori, Hiroshi Kubo:
Differential space-time coding for P-MP communications in the presence of fast time-varying beat interference. 375-379 - Shinji Nishijima, Ikuo Oka, Shingo Ata:
Maximum likelihood estimation for SNR in Nakagami fading channels. 380-383 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Reed-Solomon based nonbinary LDPC codes. 384-388 - Chi-Jen Wu, Chung-Hsuan Wang, Chi-Chao Chao:
New constructions of variable-rate QC-LDPC codes by adding column-blocks or removing row-blocks. 389-393 - Hassan Tavakoli, Abolfazl Razi:
Optimizing low density parity check code for two parallel erasure links. 394-397 - Marcello Costa, Marcelo Pinho:
An UEP scheme for optimal rate allocation of CCSDS LDPC codes. 398-402 - Keita Emura, Takuya Hayashi, Shiho Moriai:
Toward securing tire pressure monitoring systems: A case of PRESENT-based implementation. 403-407 - Hayato Shimamoto, Naoto Yanai, Shingo Okamura, Toru Fujiwara:
Web security model with cache. 408-412 - Ryo Fukuyama, Naoto Yanai, Shingo Okamura, Toru Fujiwara:
Towards a formal foundation of protection against data-oriented attacks. 413-417 - Sachiko Kanamori, Ryo Nojima, Hirotsune Sato, Naoya Tabata, Kanako Kawaguchi, Hirohiko Suwa, Atsushi Iwai:
How does the willingness to provide private information change? 418-422 - Kento Takahashi, Yasunori Ishihara:
Formalizations of secrecy of encrypted databases against realistic attackers. 423-427 - Yuta Sakai, Ken-ichi Iwata:
Extremal relations between shannon entropy and ℓα-norm. 428-432 - Yuichi Kaji:
Converging bounds of the entropy of multinomial distributions. 433-437 - Gholamreza Alirezaei, Rudolf Mathar:
On the information capacity of hinge functions. 438-442 - Kenji Nakagawa, Kohei Watabe, Takuto Sabu:
On the search algorithm for the output distribution that achieves the channel capacity. 443-447 - Jiuyang Alan Zhang, Brian M. Kurkoski:
Low-complexity quantization of discrete memoryless channels. 448-452 - Satyajit Thakor, Terence Chan, Alex J. Grant:
Characterising probability distributions via entropies. 453-457 - Takumi Takahashi, Shinsuke Ibi, Takeo Ohgane, Seiichi Sampei:
On normalized belief of Gaussian BP in correlated large MIMO channels. 458-462 - Shogo Tanabe, Akihide David Shigyo, Koji Ishibashi:
Not-so-large MIMO signal detection based on damped QR-decomposed belief propagation. 463-467 - Akihide David Shigyo, Shogo Tanabe, Koji Ishibashi:
QR-decomposed generalized belief propagation for MIMO detection. 468-472 - Shuhei Tanno, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa:
A comparison of serial and parallel LLR updates for LDPC coded massive MIMO detection with belief propagation. 473-477 - Ryo Hayakawa, Kazunori Hayashi:
Error recovery with relaxed MAP estimation for massive MIMO signal detection. 478-482 - Mitsuyoshi Hagiwara, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa:
Node selection and LLR damping for channel equalization with belief propagation. 483-487 - Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Finite length weight enumerator analysis of braided convolutional codes. 488-492 - Shan Lu, Wei Hou, Jun Cheng:
Input-output weight distribution of terminated RSC codes with limited codelength. 493-497 - Hiroshi Sasano, Kana Kikuchi, Sen Moriya:
Construction of high rate punctured convolutional codes through identical codes. 498-501 - Hideki Yoshikawa:
On the bit error probability for constant log-MAP decoding of convolutional codes. 502-506 - Tianyi Zhang, Masato Kitakami:
The effective method of improving Berlekamp-Preparata convolutional codes decoding by tail-biting technology. 507-511 - Kyosuke Nakano, Manabu Hagiwara:
Formalization of binary symmetric erasure channel based on infotheo. 512-516 - Hiroyuki Okazaki:
Formalization of statistical indistinguishability of probability distribution ensembles in Mizar. 517-521 - Manabu Hagiwara, Kyosuke Nakano, Justin Kong:
Formalization of coding theory using lean. 522-526 - Yoshihiro Mizoguchi, Hisaharu Tanaka, Shuichi Inokuchi:
Formalization of proofs using relational calculus. 527-531 - Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
Formalization of Reed-Solomon codes and progress report on formalization of LDPC codes. 532-536 - Yasutada Oohama:
Exponent function for asymmetric broadcast channels at rates outside the capacity region. 537-541 - Jun Muramatsu, Shigeki Miyake:
Fundamental limits are achievable with countable alphabet. 542-546 - Vamoua Yachongka, Hideki Yagi:
Reliability function and strong converse of biomedical identification systems. 547-551 - Avhishek Chatterjee, Daewon Seo, Lav R. Varshney:
Capacity of systems with queue-length dependent service quality. 552-556 - Gou Hosoya, Hiroyuki Yashima:
Constellation shaping for non-uniform signals based on truncated Gaussian distribution. 557-561 - Mohsen Abedi, Mohammad Javad Emadi, Behzad Shahrasbi:
Optimal energy management for energy harvesting transmitter and receiver with helper. 562-566 - Akinobu Murayama, Souichiro Morita, Nanase Yumoto, Hiroshi Kubo:
Simple channel sounders for underwater acoustic communications in the presence of double selective channel environments. 567-571 - Nanase Yumoto, Souichiro Morita, Akinobu Murayama, Hiroshi Kubo:
An off-line software modem for underwater acoustic communications and its field evaluation results. 572-576 - Hsiao-feng Francis Lu:
A feedback-aided rate-split decode-and-forward protocol for static cooperative communications. 577-581 - Yasunari Maeda, Toshiyasu Matsushima:
Theoretical limit of type-I hybrid selective-repeat ARQ with finite receiver buffer. 582-585 - Masakatu Morii, Hiroto Tamiya, Masanori Hirotomo:
Error correction capability of irregular LDPC codes under the Gallager a algorithm. 586-590 - Jun Asatani, Yuya Kondo, Kengo Katayama, Elis Kulla, Hitoshi Tokushige:
An improved noisy gradient descent bit-flipping decoding algorithm for LDPC codes. 591-595 - Ahmad Golmohammadi, Jörg Kliewer, Daniel J. Costello Jr., David G. M. Mitchell:
On the windowed encoding complexity of SC-LDGM codes for lossy source compression. 596-600 - Takayuki Nozaki:
Reduction of decoding iterations for zigzag decodable fountain codes. 601-605 - Hiroshi Fujisaki:
Correlational properties of the full-length sequences based on the discretized Markov transformations. 606-610 - Yanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin:
Individual secrecy for the broadcast channel. 611-615 - Jinxiao Zhu, Yin Chen, Masahide Sasaki:
Average secrecy capacity of free-space optical communication systems with on-off keying modulation and threshold detection. 616-620 - Chao Qi, Yanling Chen, A. J. Han Vinck, Xiaohu Tang:
Secrecy coding for the binary multiplying wiretap channel. 621-625 - Chao Qi, Yanling Chen, A. J. Han Vinck, Xiaohu Tang:
One-sided secrecy over the two-way wiretap channel. 626-630 - Hidetoshi Yokoo:
On the stationary distribution of asymmetric numeral systems. 631-635 - Mitsuharu Arimura:
A variable-to-fixed length lossless source code optimizing a different criterion of average coding rate from Tunstall code. 636-640 - Ken-ichi Iwata, Hirosuke Yamamoto:
A dynamic programming algorithm to construct optimal code trees of AIFV codes. 641-645