Technical Program
Monday, October 31
Monday, October 31, 09:00 - 10:00
Mo-M-P: Plenary Talk 1
Room: Regency Main
Monday, October 31, 10:20 - 12:00
Mo-A-1: Source Coding 1
Room: Regency 4
Chair: Hiroyoshi Morita (University of Electro-Communications, Japan)
- Evaluation of Overflow Probability of Bayes Code in Moderate Deviation Regime
- A Two-Step Universal VV Code Using an Asymptotically Sufficient Statistic Extracted from a VF Code
- Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code
- Variable-Length Coding with Cost Allowing Non-Vanishing Error Probability
- Threshold of Overflow Probability in Terms of Smooth Max-Entropy for Variable-Length Compression Allowing Errors
Mo-B-1: Coding for Distributed Strorage
Room: Regency 5
Chair: Yuichi Kaji (Nagoya University & Nara Institute of Science and Technology, Japan)
- Improved Delivery Rate-Cache Capacity Trade-off For Centralized Coded Caching
- Relationships between Correlation of Information Stored on Nodes and Coding Efficiency for Cooperative Regenerating Codes
- Alphabet-Dependent Upper Bounds for Locally Repairable Codes with Joint Locality
- Regenerating Codes with Generalized Conditions of Reconstruction and Regeneration
- On the Maintenance of Distributed Storage Systems with Backup Node for Repair
Mo-C-1: Constrained Codes
Room: Regency 6
Chair: Han Vinck (University of Duisburg-Essen & University of Johannesburg, Germany)
- A Finite Graph Representation for Two-Dimensional Finite Type Constrained Systems
- Upper Bounds for the Number of Solutions to Spatially Coupled Sudokus
- Decoding Error of Sudoku for Erasure Channels
- On Zero Error Capacity of Nearest Neighbor Error Channels with Multilevel Alphabet
- A Two-Dimensional Antidictionary Automaton for a Toric Surface
Mo-D-1: Signatures
Room: Spyglass 1-2
Chair: SeongHan Shin (AIST, Japan)
- A Construction of Attribute-based Aggregate Signatures
- Signatures from Trapdoor Commitments with Strong Openings
- Security Proof of Identity-based Signature under RSA Assumption, Reconsidered
- On Signatures with Tight Security in the Multi-User Setting
- A Generic Construction of Tight Security Signatures in the Non-Programmable Random Oracle Model
Monday, October 31, 14:00 - 15:00
Mo-M-T: Tutorial
Room: Regency Main
Monday, October 31, 15:10 - 16:10
Mo-A-2: Channel Coding with Feedback
Room: Regency 4
Chair: Tetsunao Matsuta (Tokyo Institute of Technology, Japan)
- A Non-Linear Transmission Scheme for the $K$-User Broadcast Channel with State Feedback
- Linear Superposition Coding for the Gaussian Broadcast Channel with Quantized Feedback
- ARMA(1) Gaussian Feedback Capacity Revisited
Mo-B-2: Pattern Recognition & Learning
Room: Regency 5
Chair: Manabu Kobayashi (Shonan Institute of Technology, Japan)
- Effective Construction of Compression-based Feature Space
- A Bayes Prediction Algorithm for Model Class Composed of Several Subclasses
- An Accurate Mortality Prediction Method Based on Decision-level Fusion of Existing ICU Scoring Systems
Mo-C-2: Codes for Flash Memory
Room: Regency 6
Chair: Brian Michael Kurkoski (Japan Advanced Institute of Science and Technology (JAIST), Japan)
- Construction and Analysis of Rank-Modulation Rewriting Codes by the Group of Permutation Matrices
- Maximization of Average Number of Rewriting of ILIFC with Inversion Operation
- A Construction of Non-Binary WOM Codes based on Integer Programming
Mo-D-2: Symmetric Key Encryption
Room: Spyglass 1-2
Chair: Yasuyuki Murakami (Osaka Electro-Communication University, Japan)
- A New Higher Order Differential of DBlock
- Integral characteristics of MISTY2 derived by division property
- Chaos-Based One-Time Pad Cryptography
Monday, October 31, 16:30 - 17:50
Mo-A-3: Topics in Network Information Theory
Room: Regency 4
Chair: Ryo Nomura (Senshu University, Japan)
- Variable-Length Coding for Mixed Sources with Side Information Allowing Decoding Errors
- Efficient Coding for Multi-source Networks using Gacs-Korner Common Information
- Exponent Function for Wyner-Ziv Source Coding Problem at Rates below the Rate Distortion Function
- Construction of a Channel Code from an Arbitrary Source Code with Decoder Side Information
Mo-B-3: Multiple Access
Room: Regency 5
Chair: Ikuo Oka (Osaka City University, Japan)
- Path Estimation for Multi-Carrier CDMA System with Two-Way Path-Adapted Array Antennas
- A Joint Design of Timing Tracking and Channel Estimation for IDMA Receivers
- Performance Analysis of SC-RA Coded IDMA Systems with Segmented Interleavers
- An Energy Efficient Coding Scheme for the Multiple Access Relay Channel
Mo-C-3: Spatially Coupled LDPC Codes
Room: Regency 6
Chair: Masanori Hirotomo (Saga University, Japan)
- Spatially ``Mt. Fuji'' Coupled LDPC Codes
- Avoiding Trapping Sets in SC-LDPC Codes under Windowed Decoding
- Hardware implementation of Spatially Coupled LDPC codes for broadcasting
- Spatially-Coupled Irregular LDPC Codes by Non-Square Superposition Matrices
Mo-D-3: Public Key Encryption
Room: Spyglass 1-2
Chair: Keita Emura (National Institute of Information and Communications Technology, Japan)
- An Implementation of Hybrid-Type Inter-Organization Cryptosystem Using ElGamal PKC
- Master Key Updatable Attribute-Based Encryption on the Dual Pairing Vector Space
- Tag-KEM/DEM Framework for Public-key Encryption with Non-interactive Opening
- Small Secret Exponent Attacks on RSA with Unbalanced Prime Factors
Tuesday, November 1
Tuesday, November 1, 09:00 - 10:00
Tu-M-P: Plenary Talk 2
Room: Regency Main
Tuesday, November 1, 10:20 - 12:00
Tu-A-1: Universal Coding and Estimation / Sequences 1
Room: Regency 4
Chair: Takahiro Ota (Nagano Prefectural Institute of Technology, Japan)
- Bipartite Grammar-Based Representations of Large Sparse Binary Matrices: Framework and Transforms
- A Grammar-Based Compression Using a Variation of Chomsky Normal Form of Context Free Grammar
- Rare Event Probability Estimation Using Information Projection
- Minimax Rate-optimal Estimation of KL Divergence between Discrete Distributions
- Design of LPI Signals Using Optimal Families of Perfect Polyphase Seqeunces
Tu-B-1: Sparsity
Room: Regency 5
Chair: Tadashi Wadayama (Nagoya Institute of Technology, Japan)
- Efficiently Decodable Defective Items Detected by New Model of Noisy Group Testing
- A Note on Support Recovery of Sparse Signals using Linear Programming
- Trust-Region Methods for Nonconvex Sparse Recovery Optimization
- Nonconvex Sparse Poisson Intensity Reconstruction for Time-Dependent Bioluminescence Tomography
- Distance Metric Learning based on Different l1 Regularized Metric Matrices in Each Category
Tu-C-1: Coding Theory 1
Room: Regency 6
Chair: Mao-Chao Lin (National Taiwan University, Taiwan)
- Generalized Concatenated Codes with Soft Decoding of Inner and Outer Codes
- Improving the Error-Floor Performance of Binary Half-Product Codes
- Joint Crosstalk-Avoidance and Error-Correction Coding for Parallel Data Buses
- A Study on Soft-out of Soft-in/Soft-out Decoding Algorithms for Binary Linear Codes
- Algebraic Chase Decoding of Reed-Solomon Codes Using Module Minimisation
Tu-D-1: Authentication
Room: Spyglass 1-2
Chair: Jacob Schuldt (AIST, Japan)
- A User Authentication Scheme Using Keystrokes for Smartphones while Moving
- A Practical Attack to AINA2014's Countermeasure for Cancelable Biometric Authentication Protocols
- On a variant of multilinear modular hashing with applications to authentication and secrecy codes
- A Secure Anonymous Password-based Authentication Protocol with Control of Authentication Numbers
- One Hour Term Authentication for Wi-Fi Information Captured by Smartphone Sensors
Tuesday, November 1, 14:00 - 15:40
Tu-A-2: Information Hiding / Information-Theoretic Security
Room: Regency 4
Chair: Satoshi Obana (Hosei University, Japan)
- Tone Code: A Novel Method for Covert Communications Based on Musical Components
- A Ramp Threshold Secret Sharing Scheme against Cheating by Substitution Attacks
- New Fundamental Properties on a Secret-key Cryptosystem under Guessing Secrecy Criteria
- On Secure Communication over the Multiple Access Channel
- Achieving Perfect Location Privacy in Markov Models Using Anonymization
Tu-B-2: Communication Systems 1
Room: Regency 5
Chair: Hsiao-feng Francis Lu (National Chiao Tung University, Taiwan)
- An Improvement of Media Access Control Scheme for Inter-Vehicle Communications
- Performance Evaluation of Error Control Scheme in Multihop WBAN Based on IEEE802.15.6
- Two-dimensional Diversity with Serial Concatenation of Spectral Precoding and DSTBC
- Differential Space-Time Coding for P-MP Communications in the Presence of Fast Time-Varying Beat Interference
- Maximum Likelihood Estimation for SNR in Nakagami Fading Channels
Tu-C-2: LDPC Codes
Room: Regency 6
Chair: Takayuki Nozaki (Yamaguchi University, Japan)
- Reed-Solomon Based Nonbinary LDPC Codes
- New Constructions of Variable-Rate QC-LDPC Codes by Adding Column-Blocks or Removing Row-Blocks
- Optimizing Low Density Parity Check Code for two Parallel Erasure links
- An UEP Scheme for Optimal Rate Allocation of CCSDS LDPC Codes
Tu-D-2: Data Security
Room: Spyglass 1-2
Chair: Tadanori Teruya (National Institute of Advanced Industrial Science and Technology, Japan)
- Toward Securing Tire Pressure Monitoring Systems: A Case of PRESENT-based Implementation
- Web Security Model with Cache
- Towards a Formal Foundation of Protection against Data-Oriented Attacks
- How Does the Willingness to Provide Private Information Change?
- Formalizations of secrecy of encrypted databases against realistic attackers
Tuesday, November 1, 16:00 - 18:00
Tu-A-3: Computation of Entropy and Information Capacity
Room: Regency 4
Chair: Jun Muramatsu (NTT Corporation, Japan)
- Extremal Relations Between Shannon Entropy and $\ell_{\alpha}$-Norm
- Converging Bounds of the Entropy of Multinomial Distributions
- On the Information Capacity of Hinge Functions
- On the Search Algorithm for the Output Distribution that Achieves the Channel Capacity
- Low-Complexity Quantization of Discrete Memoryless Channels
- Characterising Probability Distributions via Entropies
Tu-B-3: Large-Scale MIMO (Organized Session)
Room: Regency 5
Chair: Kazunori Hayashi (Kyoto University, Japan)
- On Normalized Belief of Gaussian BP in Correlated Large MIMO Channels
- Not-So-Large MIMO Signal Detection Based on Damped QR-Decomposed Belief Propagation
- QR-Decomposed Generalized Belief Propagation for MIMO Detection
- A Comparison of Serial and Parallel LLR Updates for LDPC Coded Massive MIMO Detection with Belief Propagation
- Error Recovery with Relaxed MAP Estimation for Massive MIMO Signal Detection
- Node Selection and LLR Damping for Channel Equalization with Belief Propagation
Tuesday, November 1, 16:00 - 17:40
Tu-C-3: Convolutional Codes
Room: Regency 6
Chair: Haruhiko Kaneko (Tokyo Institute of Technology, Japan)
- Finite Length Weight Enumerator Analysis of Braided Convolutional Codes
- Input-Output Weight Distribution of Terminated RSC Codes with Limited Codelength
- Construction of High Rate Punctured Convolutional Codes through Identical Codes
- On the bit error probability for constant log-MAP decoding of convolutional codes
- The Effective Method of Improving Berlekamp-Preparata Convolutional Codes Decoding by Tail-Biting Technology
Tuesday, November 1, 16:00 - 16:20
Tu-D-3-1: Formalization
Room: Spyglass 1-2
Chair: Manabu Hagiwara (Chiba University, Japan)
- Formalization of Binary Symmetric Erasure Channel Based on Infotheo
Tuesday, November 1, 16:20 - 18:00
Tu-D-3-2: Formalization (Organized Session)
Room: Spyglass 1-2
Chair: Manabu Hagiwara (Chiba University, Japan)
- Formalization of Statistical Indistinguishability of Probability Distribution Ensembles in Mizar
- Formalization of Coding Theory using Lean
- Formalization of proofs using relational calculus
- Formalization of Reed-Solomon codes and progress report on formalization of LDPC codes
Wednesday, November 2
Wednesday, November 2, 09:00 - 10:10
We-M-P: Recent Results Poster Session
Room: Regency Main
- On the Reciprocal Property of the Defining Set for Cyclic Codes
- Spatially Coupled Repeater-Combiner-Convolutional Code on 2-User Multiple-Access Fading Channels
- Multistage decoding on the QPEC
- Performance comparison of multilevel Polar Lattices
- Convolutional Code Lattices
- On Multiple-Valued Logic Polynomials of a Subset Type
- Constellation Shaping with Pilot Bit for Bit-Interleaved Coded Modulation
- Linear Complexity of Pseudorandom Sequence over Odd Characteristic Field
- Differential MIMO Spatial Multiplexing Employing PADM Based on Channel Prediction for Fast Time-Varying Rayleigh Fading
- Parallel Concatenated Coded Overloaded MIMO Systems
- Optimal Rate Profile for Multi-User Multi-Rate Code with Hybrid Interference Cancellation Scheme
- An Evaluation of Characteristics of Hidden Station Problem for IVC
- BER Approximation of BBOST-CPM with Quasi-OSTBC
- Laboratory evaluation of the reliable identification process for the battery cells information system
- The coding methods of RFID identifiers for automotive industry, their reliable capturing, processing and transmission to ERP systems
- Development of RFID Based Solution for Items Tracking in Logistics Networks of Automotive Industry
- Improvement of Winternitz One Time Signature
- A Generalization of Knapsack Cryptosystem using Random Secret Sequences
- The particular third-order differential characteristics of Midori64 block cipher
- A Consideration of an Efficient Calculation over the Extension Field of Degree 3 and 4 for Elliptic Curve Pairing Cryptography
- Lifestyle Authentication
- Application of adiabatic quantum computation to classical optimal decoding
- Structure Analysis of Instruction Items Applying Fuzzy Number
- Analysis of Performance Gain from Unlabeled Data in Semi-supervised Learning
- A Design Method for Band-Pass Maximally Flat FIR Fractional Order Differentiators
- Student Needs Analysis Applying Type-2 Fuzzy Contingency Table and its Application
Wednesday, November 2, 10:20 - 12:00
We-A-1: Channel Capacity and Strong Converse
Room: Regency 4
Chair: Shigeaki Kuzuoka (Wakayama University, Japan)
- Exponent Function for Asymmetric Broadcast Channels at Rates outside the Capacity Region
- Fundamental Limits Are Achievable with Countable Alphabet
- Reliability Function and Strong Converse of Biometrical Identification Systems
- Capacity of Systems with Queue-Length Dependent Service Quality
- Constellation Shaping for Non-Uniform Signals based on Truncated Gaussian Distribution
We-B-1: Communication Systems 2
Room: Regency 5
Chair: Chi-chao Chao (National Tsing Hua University, Taiwan)
- Optimal Energy Management for Energy Harvesting Transmitter and Receiver with Helper
- Simple Channel Sounders for Underwater Acoustic Communications in the Presence of Double Selective Channel Environments
- An Off-Line Software MODEM for Underwater Acoustic Communications and its Field Evaluation Results
- A Feedback-Aided Rate-Split Decode-and-Forward Protocol for Static Cooperative Communications
- Theoretical Limit of Type-I Hybrid Selective-repeat ARQ with Finite Receiver Buffer
We-C-1: Graph-Based Codes
Room: Regency 6
Chair: Jun Cheng (Doshisha University, Japan)
- Error Correction Capability of Irregular LDPC Codes under the Gallager A Algorithm
- An Improved Noisy Gradient Descent Bit-Flipping Decoding Algorithm for LDPC Codes
- On the Windowed Encoding Complexity of SC-LDGM Codes for Lossy Source Compression
- Reduction of Decoding Iterations for Zigzag Decodable Fountain Codes
- Correlational Properties of the Full-Length Sequences Based on the Discretized Markov Transformations
We-D-1: Wiretap Channel
Room: Spyglass 1-2
Chair: Mitsugu Iwamoto (The University of Electro-Communications, Japan)
- Individual Secrecy for the Broadcast Channel
- Average Secrecy Capacity of Free-Space Optical Communication Systems with On-Off Keying Modulation and Threshold Detection
- Secrecy Coding for the Binary Multiplying Wiretap Channel
- One-sided secrecy over the two-way wiretap channel
Wednesday, November 2, 14:00 - 15:40
We-A-2: Source Coding 2
Room: Regency 4
Chair: Junya Honda (The University of Tokyo, Japan)
- On the Stationary Distribution of Asymmetric Numeral Systems
- A Variable-to-Fixed Length Lossless Source Code Optimizing a Different Criterion of Average Coding Rate from Tunstall Code
- A Dynamic Programming Algorithm to Construct Optimal Code Trees of AIFV Codes
- Low-Latency Lossless Compression Using Dual-Stream Coding
- Leaner Skeleton Trees for Direct-Access Compressed Files
We-B-2: Quantum Information Theory / Network Coding
Room: Regency 5
Chair: Mikihiko Nishiara (Shinshu University, Japan)
- Quantum Factor Graphs: Closing-the-Box Operation and Variational Approaches
- 4PSK coherent-state signals can be narrow sense group covariant with respect to $\mathbb{F}_4$ by coding
- A Note on Unequal Error Protection in Random Network Coding
- A Maximum Likelihood Decoding Algorithm of Gabidulin Codes in Deterministic Network Coding
- An Underwater Environment Acoustic Signal Detection Scheme Employing Dual-Loop Adaptive Noise Canceling Based on Analog Network Coding
We-C-2: Coding Theory 2
Room: Regency 6
Chair: Tomoharu Shibuya (Sophia University & Faculty of Science and Technology, Japan)
- Ds-bounds for cyclic codes: new bounds for abelian codes
- Error-Trapping Decoding for Cyclic Codes over Symbol-Pair Read Channels
- Fixed-Symbols-based Synchronization for Insertion/Deletion/Substitution Channels
- Nonexistence of Perfect Permutation Codes in the Ulam Metric
- Multiple-Rate Maximum Rank Distance Codes
We-D-2: Cryptographic Protocols / Searchable Encryption
Room: Spyglass 1-2
Chair: Kazuki Yoneyama (Ibaraki University, Japan)
- Committed AND Protocol Using Three Cards with More Handy Shuffle
- Constant-Sum Fingerprinting for Winternitz One-Time Signature
- Fairy Ring: Ubiquitous Secure Multiparty Computation Framework for Smartphone Applications
- Searchable Symmetric Encryption Supporting Update
- Private Similarity Searchable Encryption for Euclidean Distance
Wednesday, November 2, 16:00 - 17:40
We-A-3: Gaussian Communication Systems
Room: Regency 4
Chair: Yasutada Oohama (University of Electro-Communications, Japan)
- Upper Bounds on the Capacity of 2-Layer $N$-Relay Symmetric Gaussian Network
- On the Capacity of the Half-Duplex MIMO Gaussian Diamond Channel
- Lattice Codes under Imperfect Channel State Information
- The Capacity of Fast Fading Channels using Lattice Codes: Is Separability Necessary?
- Ergodic Capacity of Less Noisy Broadcast Channel with Channel State Available at the Receivers
We-B-3: OFDM
Room: Regency 5
Chair: Takeo Ohgane (Hokkaido University, Japan)
- Embedded Pilot and Multi-Size OFDM Processing for Jointly Time and Frequency Selective Channels
- PAPR Control of OFDM Signals Using Spinal Codes
- A Study on Iterative Compensation of Frequency Offset for OFDM systems
We-C-3: Signal Processing
Room: Regency 6
Chair: Kazushi Mimura (Hiroshima city university, Japan)
- Volume of Metric Balls in Real Grassmann Manifold with an Application to Frames
- Resolution conversion of a local time-frequency region by convolution of a Gaussian and Gabor spectrum
- DoA Outdoor RFID Locator - System Verification Report
We-D-3: Sequences 2
Room: Spyglass 1-2
Chair: Tetsuya Kojima (National Institute of Technology, Tokyo College, Japan)
- A New Approach for Generating Well Balanced Pseudo-random Signed Binary Sequence Over Odd Characteristic Field
- A Design Guide of Renewal of a Parameter of the Logistic Map over Integers on Pseudorandom Number Generator
- Occurrence Rate per Bit for Any Control Parameter on the Logistic Map over Integers