Table of Contents

• Cardinalities of BAD Correcting CodesTakehiko Mori, Manabu Hagiwara. 1-5 [doi]
• An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or DeletionsToyohiko Saeki, Takayuki Nozaki. 6-10 [doi]
• Formalization of Insertion/Deletion Codes and the Levenshtein Metric in LeanJustin Kong, David J. Webb, Manabu Hagiwara. 11-15 [doi]
• Soft-Decision Decoding for DNA-Based Data StorageMu Zhang, Kui Cai, Kees A. Schouhamer Immink, Pingping Chen. 16-20 [doi]
• On Constant GC-content Cyclic DNA Codes With Long CodewordsRamy Taki ElDin, Hajime Matsui. 21-25 [doi]
• Scalable Machine Learning on Compact Data RepresentationsYasuo Tabei. 26-30 [doi]
• Fast yet Simple Natural-Gradient Descent for Variational Inference in Complex ModelsMohammad Emtiyaz Khan, Didrik Nielsen. 31-35 [doi]
• Introduction to Bandit Convex Optimization AlgorithmsWataru Kumagai. 36-39 [doi]
• Combinatorial Online PredictionKohei Hatano. 40-44 [doi]
• Generalized Dirichlet-Process-Means for Robust and Maximum Distortion CriteriaMasahiro Kobayashi, Kazuho Watanabe. 45-49 [doi]
• Entropic Centrality for non-atomic Flow NetworksFrédérique E. Oggier, Silivanxay Phetsouvanh, Anwitaman Datta. 50-54 [doi]
• Convexity of mutual information along the Ornstein-Uhlenbeck flowAndre Wibisono, Varun Jog. 55-59 [doi]
• Sparse Bayesian Hierarchical Mixture of Experts and Variational InferenceYuji Iikubo, Shunsuke Horii, Toshiyasu Matsushima. 60-64 [doi]
• On Enumerating Distributions for Associated Vectors in the Entropy SpaceSultan Alam, Satyajit Thakor, Syed Abbas. 65-69 [doi]
• Rank Metric Code-based SignatureChik-How Tan, Theo Fanuela Prabowo, Terry Shue Chien Lau. 70-74 [doi]
• A Generic Construction of an Identity-based Signature from a Sigma ProtocolMasayuki Fukumitsu, Shingo Hasegawa. 75-79 [doi]
• Efficiency Improvement in Group Signature Scheme with Probabilistic RevocationNasima Begum, Toru Nakanishi 0001. 80-84 [doi]
• A Consideration on the Transformation from Deniable Group Signature to Disavowable PKENOAi Ishida, Yusuke Sakai 0001, Goichiro Hanaoka. 85-89 [doi]
• Expected Error Rate of Probabilistic Network Codes over Gaussian Relay NetworkMotohiko Isaka. 90-94 [doi]
• Reduced Dimensional Optimal Vector Linear Index Codes for Index Coding Problems with Symmetric Neighboring and Consecutive Side-informationMahesh Babu Vaddi, B. Sundar Rajan. 95-99 [doi]
• Index Codes for Interlinked Cycle Structures with Outer CyclesKaranam Vikas Bharadwaj, B. Sundar Rajan. 100-104 [doi]
• Optimal Scalar Linear Index Codes for Some Two-Sender Unicast Index Coding ProblemsChinmayananda Arunachala, B. Sundar Rajan. 105-109 [doi]
• On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive InterferenceMahesh Babu Vaddi, B. Sundar Rajan. 110-114 [doi]
• Information Spectrum Analysis for Mismatched DecodingAnelia Somekh-Baruch. 115-119 [doi]
• Privacy Amplification: Recent Developments and ApplicationsWei Yang 0001, Rafael F. Schaefer, H. Vincent Poor. 120-124 [doi]
• Asymptotics of the Random Coding Union BoundJosep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas. 125-129 [doi]
• Connections Between the Error Probability and the r-wise Hamming DistancesHsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen. 130-134 [doi]
• Detection of Noisy and Corrupted Data Using Clustering TechniquesKui Cai, Kees A. Schouhamer Immink. 135-138 [doi]
• Sparse Multiple Access and Code Design with Near Channel Capacity PerformanceAkira Osamura, Guanghui Song, Jun Cheng 0001, Kui Cai. 139-143 [doi]
• Super Resolution Channel Estimation with Spread Spectrum Signal and Atomic Norm MinimizationDongshin Yang, Yutaka Jitsumatsu. 144-148 [doi]
• An Efficient Strategy for Applying Compute-and-Forward to the MARCMohammad Nur Hasan, Brian M. Kurkoski. 149-153 [doi]
• Block-error Threshold Analysis of Protographs in 5G-StandardAsit Kumar Pradhan, Andrew Thangaraj. 154-158 [doi]
• On the Anonymization of Differentially Private Location ObfuscationYusuke Kawamoto 0001, Takao Murakami. 159-163 [doi]
• A Succinct Model for Re-identification of Mobility Traces Based on Small Training DataTakao Murakami. 164-168 [doi]
• How to generate transparent random numbers using blockchainYuto Ehara, Mitsuru Tada. 169-173 [doi]
• Decentralized Netting Protocol over Consortium BlockchainKen Naganuma, Masayuki Yoshino, Hisayoshi Sato, Nishio Yamada, Takayuki Suzuki, Noboru Kunihiro. 174-177 [doi]
• Mobile Forensics for Cloud Storage Service on iOS SystemsCheng-Ta Huang, Hung-Jui Ko, Zhi-Wei Zhuang, Ping-Cheng Shih, Shiuh-Jeng Wang. 178-182 [doi]
• Shaping Gain of Lattices Based on Convolutional Codes and Construction AFan Zhou 0005, Brian Michael Kurkoski. 183-187 [doi]
• Reliability-Based Parametric LDLC DecodingWarangrat Wiriya, Brian M. Kurkoski. 188-192 [doi]
• The Double-Plane Algorithm: A simple algorithm for the closest vector problemFerdinand Blomqvist, Marcus Greferath. 193-197 [doi]
• On quotient metrics and decoding problemsFerdinand Blomqvist. 198-202 [doi]
• Further Results on the Error Correction Capability of Irregular LDPC Codes under the Gallager A AlgorithmMasanori Hirotomo, Hiroto Tamiya, Masakatu Morii. 203-207 [doi]
• Multi-party Key Exchange Protocols from Supersingular IsogeniesSatoshi Furukawa, Noboru Kunihiro, Katsuyuki Takashima. 208-212 [doi]
• Secure Hybrid Authentication Protocols against Malicious Key Generation CenterSeongHan Shin. 213-217 [doi]
• Card-Based Majority Voting Protocols with Three Inputs Using Three CardsYohei Watanabe 0001, Yoshihisa Kuroki, Shinnosuke Suzuki, Yuta Koga, Mitsugu Iwamoto, Kazuo Ohta. 218-222 [doi]
• A Construction of the (4, n)-Threshold Visual Cryptography Scheme Using a 3-DesignKoutaro Okada, Hiroki Koga. 223-227 [doi]
• An algebraic interpretation of the XOR-based Secret Sharing SchemesYuji Suga. 228-231 [doi]
• On the Power of Vector Linear Network CodingNiladri Das, Brijesh Kumar Rai. 232-236 [doi]
• Complete Multipartite Graph CodesYuta Kumano, Yoshiyuki Sakamaki, Hironori Uchikawa. 237-241 [doi]
• Entropy-based Graph Clustering - A Simulated Annealing ApproachFrédérique E. Oggier, Silivanxay Phetsouvanh, Anwitaman Datta. 242-246 [doi]
• Analysis on Probabilistic Construction of Connected Dominating Sets over Regular Graph EnsemblesTakafumi Nakano, Tadashi Wadayama. 247-251 [doi]
• k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault ModelSatoshi Takabe, Tadashi Wadayama. 252-256 [doi]
• Error Performance Analysis of the K-best Viterbi Decoding AlgorithmHideki Yoshikawa. 257-260 [doi]
• Decision Feedback Scheme with Criterion LR+Th for the Ensemble of Linear Block CodesToshihiro Niinomi, Hideki Yagi, Shigeichi Hirasawa. 261-265 [doi]
• On the Sphere Packing Error Exponent for Constant Subblock-Composition CodesAnshoo Tandon, Mehul Motani. 266-270 [doi]
• Exact Analysis for Error Probability of Max-Log-MAP Decoding in Sequence Dependent ChannelsTadashi Tomizuka, Riku Iwanaga, Ikuo Oka, Shingo Ata. 271-275 [doi]
• Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless ChannelsTomohiko Uyematsu, Tetsunao Matsuta. 276-280 [doi]
• Erasure Correcting Codes by Using Shift Operation and Exclusive ORYuta Hanaki, Takayuki Nozaki. 281-285 [doi]
• Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain CodesYoshihiro Murayama, Takayuki Nozaki. 286-290 [doi]
• Shifted Coded Slotted ALOHATomokazu Emoto, Takayuki Nozaki. 291-295 [doi]
• On the Local Erasure Correction Capacity of Convolutional CodesFedor I. Ivanov, Alexey Kreshchuk, Victor V. Zyablov. 296-300 [doi]
• Blind Reconstruction of Binary Cyclic Codes over Binary Erasure ChannelArti D. Yardi. 301-305 [doi]
• An Experimental Analysis on Lattice Attacks against Ring-LWE over Decomposition FieldsShota Terada, Hideto Nakano, Shinya Okumura, Atsuko Miyaji. 306-310 [doi]
• An Observation on the Randomness Assumption over LatticesTadanori Teruya. 311-315 [doi]
• An Analysis of a Defence Method against Slow HTTP DoS AttackTetsuya Hirakawa, Kanayo Ogura, Bhed Bahadur Bista, Toyoo Takata. 316-320 [doi]
• A Watermarking Method for Embedding into the External Shapes of ObjectsHiroshi Yamamoto, Kazuki Sano. 321-325 [doi]
• Suitable Symbolic Models for Cryptographic Verification of Secure Protocols in ProVerifHiroyuki Okazaki, Yuichi Futa, Kenichi Arai. 326-330 [doi]
• Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding TheoryRyutaroh Matsumoto. 331-333 [doi]
• Performance of Nonbinary Cubic CodesArun John Moncy, Pradeep Kiran Sarvepalli. 334-338 [doi]
• Quantum Key Distribution using Extended Mean King's ProblemAyumu Nakayama, Masakazu Yoshida, Jun Cheng. 339-343 [doi]
• Error performance and robustness of optimum quantum detection for MPSK signals in the presence of phase noiseTiancheng Wang, Kenji Nakahira, Tsuyoshi Sasaki Usuda. 344-348 [doi]
• A Study on the Problem of Channel Resolvability for Channels with Countable Input AlphabetShigeaki Kuzuoka. 349-353 [doi]
• Variable-Length Intrinsic Randomness Allowing Positive Value of the Average Variational DistanceJun Yoshizawa, Shota Saito, Toshiyasu Matsushima. 354-358 [doi]
• New Results on Variable-Length Lossy Compression Allowing Positive Overflow and Excess Distortion ProbabilitiesShota Saito, Hideki Yagi, Toshiyasu Matsushima. 359-363 [doi]
• Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error ProbabilityRyo Nomura, Hideki Yagi. 364-368 [doi]
• Achievable Rate Regions for Source Coding with Delayed Partial Side InformationTetsunao Matsuta, Tomohiko Uyematsu. 369-373 [doi]
• Structured Concatenation of Protograph LDPC Codes and Markers for Insertion/Deletion ChannelsRyo Shibata, Gou Hosoya, Hiroyuki Yashima. 374-378 [doi]
• Error Floor Estimation of Spatially-Coupled Irregular LDPC Code EnsemblesKengo Shibata, Shan Lu, Masakazu Yoshida, Krishna R. Narayanan, Jun Cheng. 379-383 [doi]
• On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC CodesPavel S. Rybin, Alexey A. Frolov. 384-388 [doi]
• An Improvement on the Linear Algebraic Attack for the Indeterminate Equation Encryption SchemeYasuhiko Ikematsu, Koichiro Akiyama, Tsuyoshi Takagi. 389-393 [doi]
• A New Three-Pass Code-based Zero-Knowledge Identification Scheme with Cheating Probability of Exactly HalfBagus Santoso, Taiyo Yamaguchi. 394-398 [doi]
• LPS-type Ramanujan graphsHyungrok Jo, Yoshinori Yamasaki. 399-403 [doi]
• Investigation of the Processors Evolution Using the Computer CapacityBoris Ryabko, Anton Rakitskiy. 404-408 [doi]
• Adaptive Notch Howling Canceller Using Group Delay InformationNobuhiro Mikami, Kanji Mashita, Naoyuki Aikawa. 409-412 [doi]
• Chaos-Based Stream Cipher Using a Star Network of Chaotic MapsTakaya Miyano, Kenichiro Cho. 413-417 [doi]
• Variational Bayes method for matrix factorization to two sparse factorized matricesTomoki Tamai, Koujin Takeda. 418-422 [doi]
• Recovery Guarantee of Sparse Binary Sensing Matrices under Greedy AlgorithmWen-Yao Chen, Chung-Chin Lu. 423-426 [doi]
• Typical Performance of Sparse Signal Recovery from a Linear Measurement with Large CoherenceMinori Ihara, Kazunori Iwata, Nobuo Suematsu, Kazushi Mimura. 427-431 [doi]
• Improving Polar Codes by Spatial CouplingKai-Hsin Wang, Wei Hou, Shan Lu, Ping-Yuen Wu, Yeong-Luh Ueng, Jun Cheng 0001. 432-436 [doi]
• On the Properties of Bit-Reversal Shortening in Polar CodesPrakash Chaki, Norifumi Kamiya. 437-441 [doi]
• Efficient SC Decoding of Convolutional Polar CodesRuslan Morozov, Peter Trifonov. 442-446 [doi]
• Integral Cryptanalysis of Reduced-round KASUMINobuyuki Sugio, Yasutaka Igarashi, Toshinobu Kaneko. 447-451 [doi]
• Revisited Diffusion Analysis of Salsa and ChaChaYusuke Matsuoka, Atsuko Miyaji. 452-456 [doi]
• Parallelizable Message Preprocessing for Merkle-Damgård Hash FunctionsHidenori Kuwakado, Shoichi Hirose, Masahiro Mambo. 457-461 [doi]
• Semi-Quantum Key Distribution with Limited Measurement CapabilitiesWalter O. Krawec, Eric P. Geiss. 462-466 [doi]
• Effect of Non-Symmetric Loss on Quantum Reading Using a Quasi-Bell StateKeita Ishikawa, Tiancheng Wang, Tsuyoshi Sasaki Usuda. 467-471 [doi]
• Applying a symmetrization method by coding to non-symmetric mixed-state signalsSouichi Takahira, Tsuyoshi Sasaki Usuda. 472-475 [doi]
• A Novel Construction of Quadtree-structured Zero-correlation Zone Sequence SetsTakafumi Hayashi, Yoshinobu Tanno, Anh T. Pham, Shinya Matsufuji, Kensaku Kawauchi, Takao Maeda. 476-480 [doi]
• Hadamard-type Matrices on Finite Fields and Their Applications to Sequence GenerationTetsuya Kojima. 481-485 [doi]
• A Study on Computational Methods of the Logistic Map over Integers for a Pseudorandom Number GeneratorShunsuke Araki, Hideyuki Muraoka, Takeru Miyazaki, Satoshi Uehara, Ken'ichi Kakizaki. 486-490 [doi]
• Reducing the Average Delay in Gradient CodingMing Hui Jovan Lee, Ivan Tjuawinata, Han Mao Kiah. 491-495 [doi]
• Some classes of systematic polynomial codes correcting single- and adjacent transposition errorsYanling Chen, A. J. Han Vinck. 496-500 [doi]
• Codes for Endurance-Limited MemoriesYeow Meng Chee, Michal Horovitz, Alexander Vardy, Van Khu Vu, Eitan Yaakobi. 501-505 [doi]
• Time-Varying Variable-Length Error-Correcting CodesVictor Buttigieg, Johann A. Briffa. 506-510 [doi]
• Tree-Search Decoding Using Reduced-Size StacksHsiang-Shun Shih, Chih-Shin Wang, Chia-Chun Chen, Mao Chao Lin. 511-515 [doi]
• On Hiding Access Timings in ORAMYuma Kanai, Kazuki Yoneyama. 516-519 [doi]
• Improved Verifiable Delegated Private Set IntersectionShintaro Terada, Kazuki Yoneyama. 520-524 [doi]
• Tree-based Secure Comparison of Secret Shared DataHiraku Morita, Nuttapong Attrapadung, Satsuya Ohata, Shota Yamada 0001, Koji Nuida, Goichiro Hanaoka. 525-529 [doi]
• Secure Division Protocol and Applications to Privacy-preserving Chi-squared TestsHiraku Morita, Nuttapong Attrapadung, Satsuya Ohata, Koji Nuida, Shota Yamada 0001, Kana Shimizu, Goichiro Hanaoka, Kiyoshi Asai. 530-534 [doi]
• Accuracy/Efficiency Trade-Off for Privacy-Preserving Division ProtocolSatsuya Ohata, Hiraku Morita, Goichiro Hanaoka. 535-539 [doi]
• A Consideration on Classification of Extended Binary Memoryless Sources Under Which Distinct Huffman Codes Are ConstructedNozomi Miya, Takahiro Yoshida, Hajime Jinushi. 540-544 [doi]
• Dynamic AIFV CodingTomotaka Hiraoka, Hirosuke Yamamoto. 545-549 [doi]
• A Note on Lempel-Ziv Parser Tails and Substring LengthsT. Aaron Gulliver, Ulrich Speidel, Niko Rebenich. 550-554 [doi]
• Compression by Substring Enumeration with a Finite Alphabet Using SortingTakahiro Ota, Hiroyoshi Morita, Akiko Manada. 555-559 [doi]
• Novel Signal-Code Construction for Multiple Access System over Vector-Disjunctive ChannelFedor I. Ivanov, Pavel Rybin. 560-564 [doi]
• Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder ChannelShan Lu, Wei Hou, Jun Cheng 0001, Hiroshi Kamabe. 565-569 [doi]
• Contributions to Successive Decoding for Multiple Access ChannelsLóránt Farkas, Tamás Kói. 570-574 [doi]
• Slepian-Wolf Coding with Side-Information Having Insertion/Deletion ErrorsHaruhiko Kaneko. 575-579 [doi]
• Multi-Terminal Codes Using Constrained-Random-Number GeneratorsJun Muramatsu, Shigeki Miyake. 580-584 [doi]
• Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained CodesAnshoo Tandon, Han Mao Kiah, Mehul Motani. 585-589 [doi]
• Lower Bound-oriented Parameter Calculation for AN CodingJuliana Hildebrandt, Till Kolditz, Dirk Habich, Wolfgang Lehner. 590-594 [doi]
• Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic ResourcesDanny Dubé. 595-599 [doi]
• An Upper Bound on the Generalized Cayley DistanceAkira Yamawaki, Hiroshi Kamabe, Shan Lu. 600-604 [doi]
• Properties of Binary Pearson CodesJos H. Weber, Kees A. Schouhamer Immink. 605-609 [doi]
• Equivalent Secret Key Attack against Knapsack PKC based on Subset Sum Decision ProblemRyuichi Sakai, Yasuyuki Murakami. 610-613 [doi]
• Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution AttackYasuyuki Murakami, Ryuichi Sakai. 614-617 [doi]
• Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328PYoshinori Uetake, Akihiro Sanada, Takuya Kusaka, Yasuyuki Nogami, Leo Weissbart, Sylvain Duquesne. 618-622 [doi]
• A Study on the Parameter Size of the Montgomery Trick for ECDLPKen Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami. 623-627 [doi]
• A Study on the Parameter of the Distinguished Point Method in Pollard's Rho Method for ECDLPKen Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami. 628-632 [doi]
• Examples of Formal Proofs about Data CompressionReynald Affeldt, Jacques Garrigue, Takafumi Saikawa. 633-637 [doi]
• Probability Approximation in Asymmetric Numeral SystemsHidetoshi Yokoo, Toshiki Shimizu. 638-642 [doi]
• Invariant Measures for the Subshifts Associated with the Asymmetric Binary SystemsHiroshi Fujisaki. 643-647 [doi]
• On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited ConstraintShivkumar K. Manickam, Navin Kashyap. 648-652 [doi]
• On the Capacity of State-Dependent Gaussian Z-Interference ChannelShahab Ghasemi-Goojani, Panagiotis Papadimitratos. 653-657 [doi]
• State-Dependent Gaussian Broadcast Channel with Common State ReconstructionsViswanathan Ramachandran, Meghna Sreenivasan, Sibi Raj B. Pillai, Vinod M. Prabhakaran. 658-662 [doi]
• On the Secrecy Capacity of 2-user Gaussian Interference Channel with Independent Secret KeysAditya Sinha, Parthajit Mohapatra, Jemin Lee, Tony Q. S. Quek. 663-667 [doi]
• Secrecy Performance on Half-Duplex Two-Way Multi-Relay Transmission Technique Under Wireless Physical Layer SecurityMohammed Ahmed Salem, Azlan Abdul Aziz, Mohamad Yusoff Bin Alias, Abdul Aziz. 668-672 [doi]
• The Symmetric Two-Hop Channel with an Untrusted RelayShahab Ghasemi-Goojani, Panagiotis Papadimitratos. 673-677 [doi]
• New Locator Polynomials for Cyclic CodesChong-Dao Lee. 678-682 [doi]
• Joint Reconstruction of Reed-Solomon Encoder and Convolutional Interleaver in a Noisy EnvironmentSwaminathan Ramabadran, A. S. Madhukumar, Guohua Wang, Shang-Kee Ting. 683-687 [doi]
• Some Constructions of Optimal Locally Repairable CodesWentu Song, Kui Cai. 688-692 [doi]
• Shortened Cyclic Codes for Correcting and Detecting Burst ErrorsRoy D. Cideciyan, Simeon Furrer, Mark A. Lantz. 693-697 [doi]
• A New Key Encapsulation CombinerTakahiro Matsuda 0002, Jacob C. N. Schuldt. 698-702 [doi]
• A Remark on an Identity-Based Encryption Scheme with Non-interactive OpeningYusuke Sakai 0001, Goichiro Hanaoka. 703-706 [doi]
• Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable EncryptionJunrichiro Hayata, Masahito Ishizaka, Yusuke Sakai 0001, Goichiro Hanaoka, Kanta Matsuura. 707-711 [doi]
• Embedding Lemmas for Functional EncryptionRyo Kato, Naohisa Nishida, Ryo Hirano, Tatsumi Oba, Yuji Unagami, Shota Yamada 0001, Tadanori Teruya, Nuttapong Attrapadung, Takahiro Matsuda 0002, Goichiro Hanaoka. 712-716 [doi]
• Asymptotic Behavior of Typical Sets and the Smallest High Probability SetMunenori Eto, Masanori Kawakita, Jun'ichi Takeuchi. 717-721 [doi]
• Second-Order Optimal Test in Composite Hypothesis TestingShun Watanabe. 722-726 [doi]
• Generalized Fano-Type Inequality for Countably Infinite Systems with List-DecodingYuta Sakai. 727-731 [doi]
• Analysis for the Slow Convergence in Arimoto AlgorithmKenji Nakagawa, Yoshinori Takei, Kohei Watabe. 732-736 [doi]
• Post Encryption Compression with Affine Encoders for Secrecy Amplification in Distributed Source Encryption with Correlated KeysBagus Santoso, Yasutada Oohama. 737-741 [doi]
• Distributed Hypothesis Testing with Privacy ConstraintsSelma Belhadj Amor, Atefeh Gilani, Sadaf Salehkalaibar, Vincent Y. F. Tan. 742-746 [doi]
• A new proof of an inequality between two secrecy exponentsUkyo Michiwaki, Yutaka Jitsumatsu. 747-751 [doi]
• A Finite Block Length Achievability Bound for Low Probability of Detection CommunicationNick A. Letzepis. 752-756 [doi]