Table of Contents

• Evaluation of overflow probability of Bayes code in moderate deviation regimeShota Saito, Toshiyasu Matsushima. 1-5 [doi]
• A two-step universal VV code using an asymptotically sufficient statistic extracted from a VF codeMitsuharu Arimura, Hiroshi Nagaoka. 6-10 [doi]
• Variable-to-fixed length homophonie coding with a modified Shannon-Fano-Elias codeJunya Honda, Hirosuke Yamamoto. 11-15 [doi]
• Variable-length coding with cost allowing non-vanishing error probabilityHideki Yagi, Ryo Nomura. 16-20 [doi]
• Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errorsShota Saito, Toshiyasu Matsushima. 21-25 [doi]
• Improved delivery rate-cache capacity trade-off for centralized coded cachingMohammad Mohammadi Amiri, Deniz Gündüz. 26-30 [doi]
• Relationships between correlation of information stored on nodes and coding efficiency for cooperative regenerating codesTakahiro Yoshida, Toshiyasu Matsushima. 31-35 [doi]
• Alphabet-dependent upper bounds for locally repairable codes with joint localityJung-Hyun Kim, Mi Young Nam, Hong-Yeop Song. 36-40 [doi]
• Regenerating codes with generalized conditions of reconstruction and regenerationAkira Kamatsuka, Yuta Azuma, Takahiro Yoshida, Toshiyasu Matsushima. 41-45 [doi]
• On the maintenance of distributed storage systems with backup node for repairGokhan Calis, Onur Ozan Koyluoglu. 46-50 [doi]
• A finite graph representation for two-dimensional finite type constrained systemsTakahiro Ota, Akiko Manada, Hiroyoshi Morita. 51-55 [doi]
• Upper bounds for the number of solutions to spatially coupled SudokusTadahiro Kitazono, Kazushi Mimura. 56-60 [doi]
• Decoding error of Sudoku for erasure channelsMikihiko Nishiara, Ryo Hidai. 61-65 [doi]
• On zero error capacity of Nearest Neighbor Error channels with multilevel alphabetTakafumi Nakano, Tadashi Wadayama. 66-70 [doi]
• A two-dimensional antidictionary automaton for a toric surfaceTakahiro Ota, Akiko Manada, Hiroyoshi Morita. 71-75 [doi]
• A construction of attribute-based aggregate signaturesShingo Hasegawa, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya, Ryo Takahashi. 76-80 [doi]
• Signatures from trapdoor commitments with strong openingsGoichiro Hanaoka, Jacob C. N. Schuldt. 81-85 [doi]
• Security proof of identity-based signature under RSA assumption, reconsideredShogo Kimura, Kazuki Yoneyama. 86-90 [doi]
• On signatures with tight security in the multi-user settingGoichiro Hanaoka, Jacob C. N. Schuldt. 91-95 [doi]
• A generic construction of tight security signatures in the non-programmable random oracle modelMasayuki Fukumitsu, Shingo Hasegawa. 96-100 [doi]
• A non-linear transmission scheme for the K-user broadcast channel with state feedbackChao He, Sheng Yang, Pablo Piantanida. 101-105 [doi]
• Linear superposition coding for the Gaussian broadcast channel with quantized feedbackStefan Farthofer, Gerald Matz. 106-110 [doi]
• ARMA(1) Gaussian feedback capacity revisitedGuangyue Han, Tao Liu. 111-115 [doi]
• Effective construction of compression-based feature spaceHisashi Koga, Yuji Nakajima, Takahisa Toda. 116-120 [doi]
• A Bayes prediction algorithm for model class composed of several subclassesMasayuki Goto, Manabu Kobayashi, Kenta Mikawa, Shigeichi Hirasawa. 121-125 [doi]
• An accurate mortality prediction method based on decision-level fusion of existing ICU scoring systemsYasutaka Hatakeyama, Takahiro Ogawa, Hirokazu Tanaka, Miki Haseyama. 126-130 [doi]
• Construction and analysis of rank-modulation rewriting codes by the group of permutation matricesTomoharu Shibuya, Takeru Sudo. 131-135 [doi]
• Maximization of average number of rewriting of ILIFC with inversion operationAkira Yamawaki, Hiroshi Kamabe. 136-140 [doi]
• A construction of non-binary WOM codes based on integer programmingYoju Fujino, Tadashi Wadayama. 141-145 [doi]
• A new higher order differential of DBlockNaoki Shibayama, Toshinobu Kaneko. 146-150 [doi]
• Integral characteristics of MISTY2 derived by division propertyNobuyuki Sugio, Yasutaka Igarashi, Toshinobu Kaneko. 151-155 [doi]
• Chaos-based one-time pad cryptographyTakaya Miyano, Kenichiro Cho. 156-160 [doi]
• Variable-length coding for mixed sources with side information allowing decoding errorsShigeaki Kuzuoka. 161-165 [doi]
• Efficient coding for multi-source networks using Gács-Körner common informationSalman Salamatian, Asaf Cohen 0001, Muriel Médard. 166-170 [doi]
• Exponent function for Wyner-Ziv source coding problem at rates below the rate distortion functionYasutada Oohama. 171-175 [doi]
• Construction of a channel code from an arbitrary source code with decoder side informationJun Muramatsu, Shigeki Miyake. 176-180 [doi]
• Path estimation for multi-carrier CDMA system with two-way path-adapted array antennasKenji Ueda, Akira Nakamura, Makoto Itami, Kohji Itoh. 181-185 [doi]
• A joint design of timing tracking and channel estimation for IDMA receiversChia-Fu Chang, Yen-Ching Liu, Meng-Hsun Yu, Mao Chao Lin. 186-190 [doi]
• Performance analysis of SC-RA coded IDMA systems with segmented interleaversTakatoshi Sakaguchi, Kengo Shibata, Wei Hou, Masakazu Yoshida, Jun Cheng. 191-195 [doi]
• An energy efficient coding scheme for the multiple access relay channelEhsan Moeen Taghavi, Mostafa Monemizadeh, Sajjad Bahrami, Ghosheh Abed Hodtani. 196-200 [doi]
• Spatially "Mt. Fuji" coupled LDPC codesYuta Nakahara, Shota Saito, Toshiyasu Matsushima. 201-205 [doi]
• Avoiding trapping sets in SC-LDPC codes under windowed decodingAllison Beemer, Christine A. Kelley. 206-210 [doi]
• Hardware implementation of spatially coupled LDPC codes for broadcastingShingo Asakura, Makoto Tanahashi, Madoka Nakamura, Masahiro Okano, Kenichi Tsuchida. 211-215 [doi]
• Spatially-coupled irregular LDPC codes by non-square superposition matricesKengo Shibata, Masakazu Yoshida, Jun Cheng. 216-220 [doi]
• An implementation of hybrid-type inter-organization cryptosystem using ElGamal PKCTatsuki Miyamoto, Yasuyuki Murakami. 221-225 [doi]
• Master key updatable attribute-based encryption on the dual pairing vector spaceYutaka Kawai. 226-230 [doi]
• Tag-KEM/DEM framework for public-key encryption with non-interactive openingYusuke Sakai, Takahiro Matsuda 0002, Goichiro Hanaoka. 231-235 [doi]
• Small secret exponent attacks on RSA with unbalanced prime factorsAtsushi Takayasu, Noboru Kunihiro. 236-240 [doi]
• Bipartite grammar-based representations of large sparse binary matrices: Framework and transformsEn-Hui Yang, Jingyun Bian. 241-245 [doi]
• A grammar-based compression using a variation of Chomsky normal form of context free grammarMitsuharu Arimura. 246-250 [doi]
• Rare event probability estimation using information projectionAnh Thu Phan Ho, Wadih Sawaya, Patrick Bas. 251-255 [doi]
• Minimax rate-optimal estimation of KL divergence between discrete distributionsYanjun Han, Jiantao Jiao, Tsachy Weissman. 256-260 [doi]
• Design of LPI signals using optimal families of perfect polyphase sequencesInseon Kim, Ki-Hyeon Park, Min Kyu Song, Hong-Yeop Song, Jang Yong Lee. 261-264 [doi]
• Efficiently decodable defective items detected by new model of noisy group testingThach V. Bui, Tetsuya Kojima, Isao Echizen. 265-269 [doi]
• A note on support recovery of sparse signals using linear programmingShunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa. 270-274 [doi]
• Trust-region methods for nonconvex sparse recovery optimizationJennifer B. Erway, Robert J. Plemmons, Lasith Adhikari, Roummel F. Marcia. 275-279 [doi]
• Nonconvex sparse poisson intensity reconstruction for time-dependent bioluminescence tomographyLasith Adhikari, Arnold D. Kim, Roummel F. Marcia. 280-284 [doi]
• Distance metric learning based on different ℓ1 regularized metric matrices in each categoryKenta Mikawa, Manabu Kobayashi, Masayuki Goto, Shigeichi Hirasawa. 285-289 [doi]
• Generalized concatenated codes with soft decoding of inner and outer codesIgor Zhilin, Alexey Kreschuk, Victor V. Zyablov. 290-294 [doi]
• Improving the error-floor performance of binary half-product codesThomas Mittelholzer, Thomas P. Parnell, Nikolaos Papandreou, Haralampos Pozidis. 295-299 [doi]
• A study on soft-out of soft-in/soft-out decoding algorithms for binary linear codesShohei Fujimoto, Takuya Kusaka, Shunsuke Ueda. 300-304 [doi]
• Algebraic chase decoding of Reed-Solomon codes using module minimisationLi Chen, Martin Bossert. 305-309 [doi]
• A user authentication scheme using keystrokes for smartphones while movingHiroya Takahashi, Kanayo Ogura, Bhed Bahadur Bista, Toyoo Takata. 310-314 [doi]
• A practical attack to AINA2014's countermeasure for cancelable biometric authentication protocolsTakato Hirano, Takashi Ito, Yutaka Kawai, Nori Matsuda, Takumi Yamamoto, Tatsuji Munaka. 315-319 [doi]
• On a variant of multilinear modular hashing with applications to authentication and secrecy codesKhodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth. 320-324 [doi]
• A secure anonymous password-based authentication protocol with control of authentication numbersSeongHan Shin, Kazukuni Kobara. 325-329 [doi]
• One hour term authentication for Wi-Fi information captured by smartphone sensorsRyosuke Kobayashi, Rie Shigetomi Yamaguchi. 330-334 [doi]
• Tone code: A novel method for covert communications based on musical componentsKan Kamada, Tetsuya Kojima, Udaya Parampalli. 335-339 [doi]
• A ramp threshold secret sharing scheme against cheating by substitution attacksWataru Nakamura, Hirosuke Yamamoto, Terence Chan. 340-344 [doi]
• New fundamental properties on a secret-key cryptosystem under guessing secrecy criteriaShota Kamiya, Hiroki Koga. 345-349 [doi]
• On secure communication over the multiple access channelYanling Chen, Onur Ozan Koyluoglu, A. J. Han Vinck. 350-354 [doi]
• Achieving perfect location privacy in Markov models using anonymizationZarrin Montazeri, Amir Houmansadr, Hossein Pishro-Nik. 355-359 [doi]
• An improvement of media access control scheme for inter-vehicle communicationsTakahiro Yokomori, Masahiro Fujii, Hiroyuki Hatano, Atsushi Ito, Yu Watanabe. 360-364 [doi]
• Performance evaluation of error control scheme in multihop WBAN based on IEEE802.15.6Kento Takabayashi, Hirokazu Tanaka, Chika Sugimoto, Ryuji Kohno. 365-369 [doi]
• Two-dimensional diversity with serial concatenation of spectral precoding and DSTBCKanako Yamaguchi, Nicolas Gresset, Hiroshi Nishimoto, Akihiro Okazaki, Shusaku Umeda, Kaoru Tsukamoto, Hiroyasu Sano, Atsushi Okamura. 370-374 [doi]
• Differential space-time coding for P-MP communications in the presence of fast time-varying beat interferenceTakuma Yamagishi, Toshiki Mori, Hiroshi Kubo. 375-379 [doi]
• Maximum likelihood estimation for SNR in Nakagami fading channelsShinji Nishijima, Ikuo Oka, Shingo Ata. 380-383 [doi]
• Reed-Solomon based nonbinary LDPC codesJuane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar. 384-388 [doi]
• New constructions of variable-rate QC-LDPC codes by adding column-blocks or removing row-blocksChi-Jen Wu, Chung-Hsuan Wang, Chi-Chao Chao. 389-393 [doi]
• Optimizing low density parity check code for two parallel erasure linksHassan Tavakoli, Abolfazl Razi. 394-397 [doi]
• An UEP scheme for optimal rate allocation of CCSDS LDPC codesMarcello Costa, Marcelo Pinho. 398-402 [doi]
• Toward securing tire pressure monitoring systems: A case of PRESENT-based implementationKeita Emura, Takuya Hayashi 0001, Shiho Moriai. 403-407 [doi]
• Web security model with cacheHayato Shimamoto, Naoto Yanai, Shingo Okamura, Toru Fujiwara. 408-412 [doi]
• Towards a formal foundation of protection against data-oriented attacksRyo Fukuyama, Naoto Yanai, Shingo Okamura, Toru Fujiwara. 413-417 [doi]
• How does the willingness to provide private information change?Sachiko Kanamori, Ryo Nojima, Hirotsune Sato, Naoya Tabata, Kanako Kawaguchi, Hirohiko Suwa, Atsushi Iwai. 418-422 [doi]
• Formalizations of secrecy of encrypted databases against realistic attackersKento Takahashi, Yasunori Ishihara. 423-427 [doi]
• Extremal relations between shannon entropy and ℓα-normYuta Sakai, Ken-ichi Iwata. 428-432 [doi]
• Converging bounds of the entropy of multinomial distributionsYuichi Kaji. 433-437 [doi]
• On the information capacity of hinge functionsGholamreza Alirezaei, Rudolf Mathar. 438-442 [doi]
• On the search algorithm for the output distribution that achieves the channel capacityKenji Nakagawa, Kohei Watabe, Takuto Sabu. 443-447 [doi]
• Low-complexity quantization of discrete memoryless channelsJiuyang Alan Zhang, Brian M. Kurkoski. 448-452 [doi]
• Characterising probability distributions via entropiesSatyajit Thakor, Terence Chan, Alex J. Grant. 453-457 [doi]
• On normalized belief of Gaussian BP in correlated large MIMO channelsTakumi Takahashi, Shinsuke Ibi, Takeo Ohgane, Seiichi Sampei. 458-462 [doi]
• Not-so-large MIMO signal detection based on damped QR-decomposed belief propagationShogo Tanabe, Akihide David Shigyo, Koji Ishibashi. 463-467 [doi]
• QR-decomposed generalized belief propagation for MIMO detectionAkihide David Shigyo, Shogo Tanabe, Koji Ishibashi. 468-472 [doi]
• A comparison of serial and parallel LLR updates for LDPC coded massive MIMO detection with belief propagationShuhei Tanno, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa. 473-477 [doi]
• Error recovery with relaxed MAP estimation for massive MIMO signal detectionRyo Hayakawa, Kazunori Hayashi. 478-482 [doi]
• Node selection and LLR damping for channel equalization with belief propagationMitsuyoshi Hagiwara, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa. 483-487 [doi]
• Finite length weight enumerator analysis of braided convolutional codesSaeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat. 488-492 [doi]
• Input-output weight distribution of terminated RSC codes with limited codelengthShan Lu, Wei Hou, Jun Cheng. 493-497 [doi]
• Construction of high rate punctured convolutional codes through identical codesHiroshi Sasano, Kana Kikuchi, Sen Moriya. 498-501 [doi]
• On the bit error probability for constant log-MAP decoding of convolutional codesHideki Yoshikawa. 502-506 [doi]
• The effective method of improving Berlekamp-Preparata convolutional codes decoding by tail-biting technologyTianyi Zhang, Masato Kitakami. 507-511 [doi]
• Formalization of binary symmetric erasure channel based on infotheoKyosuke Nakano, Manabu Hagiwara. 512-516 [doi]
• Formalization of statistical indistinguishability of probability distribution ensembles in MizarHiroyuki Okazaki. 517-521 [doi]
• Formalization of coding theory using leanManabu Hagiwara, Kyosuke Nakano, Justin Kong. 522-526 [doi]
• Formalization of proofs using relational calculusYoshihiro Mizoguchi, Hisaharu Tanaka, Shuichi Inokuchi. 527-531 [doi]
• Formalization of Reed-Solomon codes and progress report on formalization of LDPC codesReynald Affeldt, Jacques Garrigue, Takafumi Saikawa. 532-536 [doi]
• Exponent function for asymmetric broadcast channels at rates outside the capacity regionYasutada Oohama. 537-541 [doi]
• Fundamental limits are achievable with countable alphabetJun Muramatsu, Shigeki Miyake. 542-546 [doi]
• Reliability function and strong converse of biomedical identification systemsVamoua Yachongka, Hideki Yagi. 547-551 [doi]
• Capacity of systems with queue-length dependent service qualityAvhishek Chatterjee, Daewon Seo, Lav R. Varshney. 552-556 [doi]
• Constellation shaping for non-uniform signals based on truncated Gaussian distributionGou Hosoya, Hiroyuki Yashima. 557-561 [doi]
• Optimal energy management for energy harvesting transmitter and receiver with helperMohsen Abedi, Mohammad Javad Emadi, Behzad Shahrasbi. 562-566 [doi]
• Simple channel sounders for underwater acoustic communications in the presence of double selective channel environmentsAkinobu Murayama, Souichiro Morita, Nanase Yumoto, Hiroshi Kubo. 567-571 [doi]
• An off-line software modem for underwater acoustic communications and its field evaluation resultsNanase Yumoto, Souichiro Morita, Akinobu Murayama, Hiroshi Kubo. 572-576 [doi]
• A feedback-aided rate-split decode-and-forward protocol for static cooperative communicationsHsiao-feng Francis Lu. 577-581 [doi]
• Theoretical limit of type-I hybrid selective-repeat ARQ with finite receiver bufferYasunari Maeda, Toshiyasu Matsushima. 582-585 [doi]
• Error correction capability of irregular LDPC codes under the Gallager a algorithmMasakatu Morii, Hiroto Tamiya, Masanori Hirotomo. 586-590 [doi]
• An improved noisy gradient descent bit-flipping decoding algorithm for LDPC codesJun Asatani, Yuya Kondo, Kengo Katayama, Elis Kulla, Hitoshi Tokushige. 591-595 [doi]
• On the windowed encoding complexity of SC-LDGM codes for lossy source compressionAhmad Golmohammadi, Jörg Kliewer, Daniel J. Costello Jr., David G. M. Mitchell. 596-600 [doi]
• Reduction of decoding iterations for zigzag decodable fountain codesTakayuki Nozaki. 601-605 [doi]
• Correlational properties of the full-length sequences based on the discretized Markov transformationsHiroshi Fujisaki. 606-610 [doi]
• Individual secrecy for the broadcast channelYanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin. 611-615 [doi]
• Average secrecy capacity of free-space optical communication systems with on-off keying modulation and threshold detectionJinxiao Zhu, Yin Chen, Masahide Sasaki. 616-620 [doi]
• Secrecy coding for the binary multiplying wiretap channelChao Qi, Yanling Chen, A. J. Han. Vinck, Xiaohu Tang. 621-625 [doi]
• One-sided secrecy over the two-way wiretap channelChao Qi, Yanling Chen, A. J. Han. Vinck, Xiaohu Tang. 626-630 [doi]
• On the stationary distribution of asymmetric numeral systemsHidetoshi Yokoo. 631-635 [doi]
• A variable-to-fixed length lossless source code optimizing a different criterion of average coding rate from Tunstall codeMitsuharu Arimura. 636-640 [doi]
• A dynamic programming algorithm to construct optimal code trees of AIFV codesKen-ichi Iwata, Hirosuke Yamamoto. 641-645 [doi]
• Low-latency lossless compression using dual-stream codingHaruhiko Kaneko, Yuki Katsu. 646-650 [doi]
• Quantum factor graphs: Closing-the-box operation and variational approachesMichael X. Cao, Pascal O. Vontobel. 651-655 [doi]
• 4PSK coherent-state signals can be narrow sense group covariant with respect to F4 by codingMinami Tanaka, Asuka Ohashi, Tsuyoshi Sasaki Usuda. 656-660 [doi]
• A note on unequal error protection in random network codingTomohiko Saito, Koki Kazama, Toshihiro Niinomi, Toshiyasu Matsushima. 661-665 [doi]
• A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network codingKoki Kazama, Akira Kamatsuka, Toshiyasu Matsushima. 666-670 [doi]
• An underwater environment acoustic signal detection scheme employing dual-loop adaptive noise canceling based on analog network codingShota Nagano, Shohei Kawai, Hiroshi Kubo. 671-675 [doi]
• Ds-bounds for cyclic codes: New bounds for abelian codesJosé Joaquín Bernal, Juan Jacobo Simón, M. Guerreiro. 676-680 [doi]
• Error-trapping decoding for cyclic codes over symbol-pair read channelsMasakatu Morii, Masanori Hirotomo, Makoto Takita. 681-685 [doi]
• Fixed-symbols-based synchronization for insertion/deletion/substitution channelsRyo Shibata, Gou Hosoya, Hiroyuki Yashima. 686-690 [doi]
• Nonexistence of perfect permutation codes in the Ulam metricJustin Kong, Manabu Hagiwara. 691-695 [doi]
• Multiple-rate maximum rank distance codesR. S. Raja Durai. 696-699 [doi]
• Committed AND protocol using three cards with more handy shuffleKazumasa Shinagawa, Koji Nuida, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto. 700-702 [doi]
• Constant-sum fingerprinting for Winternitz one-time signatureJason Paul Cruz, Yoshio Yatani, Yuichi Kaji. 703-707 [doi]
• Fairy ring: Ubiquitous secure multiparty computation framework for smartphone applicationsTadanori Teruya, Yoshiki Aoki, Jun Sakuma. 708-712 [doi]
• Searchable symmetric encryption supporting updateShunta Nozoe, Satoshi Obana. 713-717 [doi]
• Private similarity searchable encryption for Euclidean distanceYuji Unagami, Natsume Matsuzaki, Shota Yamada 0001, Nuttapong Attrapadung, Takahiro Matsuda 0002, Goichiro Hanaoka. 718-722 [doi]
• Upper bounds on the capacity of 2-layer N-relay symmetric Gaussian networkSatyajit Thakor, Syed Abbas. 723-727 [doi]
• On the capacity of the half-duplex MIMO Gaussian diamond channelAntony V. Mampilly, Srikrishna Bhashyam. 728-732 [doi]
• Lattice codes under imperfect channel state informationAhmed Hindy, Aria Nosratinia. 733-737 [doi]
• The capacity of fast fading channels using lattice codes: Is separability necessary?Ahmed Hindy, Aria Nosratinia. 738-742 [doi]
• Ergodic capacity of less noisy broadcast channel with channel state available at the receiversSajjad Bahrami, Mostafa Monemizadeh, Ehsan Moeen Taghavi, Ghosheh Abed Hodtani. 743-747 [doi]
• Embedded pilot and multi-size OFDM processing for jointly time and frequency selective channelsChristian Schlegel, Marcel Jar. 748-752 [doi]
• PAPR control of OFDM signals using spinal codesHodaka Tashiro, Yu Morishima, Ikuo Oka, Shingo Ata. 753-756 [doi]
• A study on iterative compensation of frequency offset for OFDM systemsMasahiro Fujii, Masaya Ito, Hiroyuki Hatano, Atsushi Ito, Yu Watanabe. 757-761 [doi]
• Volume of metric balls in real Grassmann manifold with an application to framesSantosh Kumar, Renaud-Alexandre Pitaval, Lu Wei. 762-766 [doi]
• Resolution conversion of a local time-frequency region by convolution of a Gaussian and Gabor spectrumMasayuki Takagi, Shuichi Arai. 767-771 [doi]
• DoA outdoor RFID locator - system verification reportLukas Vojtech, Radoslav Bortel, Marek Neruda, Radek Holy, Pavel Stasa, Filip Benes, Jiri Svub, Jakub Unucka. 772-776 [doi]
• A new approach for generating well balanced Pseudo-random signed binary sequence over odd characteristic fieldAli Md. Arshad, Yasuyuki Nogami, Chiaki Ogawa, Hiroto Ino, Satoshi Uehara, Robert Morelos-Zaragoza, Kazuyoshi Tsuchiya. 777-780 [doi]
• A design guide of renewal of a parameter of the logistic map over integers on pseudorandom number generatorShunsuke Araki, Hideyuki Muraoka, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki. 781-785 [doi]
• Occurrence rate per bit for any control parameter on the logistic map over integersHideyuki Muraoka, Shunsuke Araki, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki. 786-790 [doi]