Technical Program
Online presentations are marked with [ONLINE]
Time | Main Convention Hall | Room 101 | Room 102 |
Monday, October 17 |
|||
13:30-14:30 | M-PT-Main: Plenary Talk 1 | ||
14:50-15:50 | M-SS-Main: Symposium Session | ||
Tuesday, October 18 |
|||
09:00-10:15 | T-1-101: Error-Correcting Codes | T-1-102: Sparsity | |
10:30-12:10 | T-2-101: Capacity | T-2-102: Cryptography and Primitives | |
12:10-12:40 | T-PR-101: Poster Review 1 A | T-PR-102: Poster Review 1 B | |
13:50-15:05 | T-3-101: Codes for Storage | T-3-102: Algorithms | |
15:20-16:20 | T-PT-101+2: Plenary Talk 2 | ||
16:35-18:15 | T-4-101: Constrained Codes | T-4-102: Communication | |
Wednesday, October 19 |
|||
09:00-10:15 | W-1-101: Learning | W-1-102: Security and Coding | |
10:30-12:10 | W-2-101: Coding Theory | W-2-102: Security and Information Theory | |
12:10-12:40 | W-PR-101: Poster Review 2 A | W-PR-102: Poster Review 2 B | |
14:00-14:30 | Award Ceremony | ||
14:50-16:30 | W-3-101: Applications and Quantum | W-3-102: Privacy | |
16:45-18:00 | W-4-101: Source Coding |
Monday, October 17
Monday, October 17 13:30 - 14:30
M-PT-Main: Plenary Talk 1
Hiroyoshi Morita (The University of Electro-Communications, Japan)
Room: Main Convention HallMonday, October 17 14:50 - 15:50
M-SS-Main: Symposium Session
Room: Main Convention Hall
Tuesday, October 18
Tuesday, October 18 9:00 - 10:15
T-1-101: Error-Correcting Codes
Room 101
Chair: Masanori Hirotomo (Saga University, Japan)
- A Class of Cyclic Partial Geometries and Their Associated Constant Weight and LDPC Codes [ONLINE]
- Bit-Level Informed Dynamic Scheduling for Decoding Non-binary LDPC Codes [ONLINE]
- Some Girth-8 Linear Code is a 3-SEQ LRC [ONLINE]
T-1-102: Sparsity
Room 102
Chair: Kazushi Mimura (Hiroshima City University, Japan)
- Ordinary Differential Equation-based Sparse Signal Recovery
- Sparse Signal Reconstruction with QUBO Formulation of l0-Regularized Linear Regression
- Theory of the optimum interpolation reconstruction and an application for Parallel MRI [ONLINE]
Tuesday, October 18 10:30 - 12:10
T-2-101: Capacity
Room 101
Chair: Mitsuharu Arimura (Shonan Institute of Technology & Faculty of Engineering, Japan)
- A Tighter Lower Bound on the Capacity of the Cascading Binary Deletion Channel and Binary Symmetric Channel [ONLINE]
- Channel Capacity with Cost Constraint Allowing Some Cost Overrun
- On the Achievability of Interference Channel Coding
- On the Optimum Achievable Rates of a Coded Caching Scheme with Small Cache Memory
T-2-102: Cryptography and Primitives
Room 102
Chair: Hidenori Kuwakado (Kansai University, Japan)
- Revisiting Lattice-Based Attacks Using Trace Map for Ring-LWE
- High-Density Knapsack Cryptosystem using Shifted-Odd and Super-Increasing Sequence
- Three-Pass Identification Scheme Based on MinRank Problem with Half Cheating Probability
- Hash-Chain-Based Sanitizable Signatures for Deletion and Generalization Processes
Tuesday, October 18 12:10 - 12:40
T-PR-101: Poster Review 1 A
Room 101
- Adaptively Decodable Visual Secret Sharing Scheme on Background Color
- Consideration on the required number of quantization bits for SGRAND
- Reed-Muller Sequence-Based Block Orthogonal Sparse Superposition Codes
- On Timing for Applying the Updating Parameters of Sum-Product/BP Decoding
T-PR-102: Poster Review 1 B
Room 102
- Realization of ID-based Non-Interactive Key Sharing Scheme based on Discrete Logarithm Problem over Composite Number
- NIST Statistical Test for Public Keys of Representative Modular Knapsack Cryptosystems
- Security Information Retrieval Engine for Cyber Attack Analysis
- CSciBERT: Computer Science-Domain Pretrained Language Model
- Re-learning Techniques for Continuous Operation of Automated Vulnerability Assessment System
Tuesday, October 18 13:50 - 15:05
T-3-101: Codes for Storage
Room 101
Chair: Akiko Manada (Nagaoka University of Technology, Japan)
- Balanced coding with Lehmer code
- High Areal Density Heated Dot Magnetic Recording Systems with Double-layered Bit Patterned Media
- Codes for Constrained Periodicity
T-3-102: Algorithms
Room 102
Chair: Hideki Yagi (University of Electro-Communications, Japan)
- A numerical study of multi-letter Ahlswede-Han scheme for modulo-sum problem
- An Algorithm for Computing the Stratonovich's Value of Information
- Enumeration and Coding of Binary AIFV-m Code Trees
Tuesday, October 18 15:20 - 16:20
T-PT-101+2: Plenary Talk 2 [ONLINE]
Neri Merhav (Technion, Israel)
Rooms: Room 101, Room 102Tuesday, October 18 16:35 - 18:15
T-4-101: Constrained Codes
Room 101
Chair: Hiroshi Kamabe (Gifu University, Japan)
- Average Redundancy of Variable-Length Balancing Schemes à la Knuth
- Reconstruction from Substrings with Partial Overlap
- A Necessary and Sufficient Condition for Reconstruction of Circular Binary String based on the Lengths of Substrings with Weights
- The Maximum Run-Length Constrained Balanced Codes for Random-Access DNA Storage
T-4-102: Communication
Room 102
Chair: Motohiko Isaka (Kwansei Gakuin University, Japan)
- Finite Blocklength Analysis of Cooperative Superposition Coded Relaying Systems over Nakagami-m Fading Channels
- PSOR-Jacobi Algorithm for Accelerated MMSE MIMO Detection
- Near-Optimal Designs of Hybrid Massive MIMO Systems from Lattice Decoding [ONLINE]
- New Inner and Outer Bounds for Gaussian Broadcast Channels with Heterogeneous Blocklength Constraints
Wednesday, October 19
Wednesday, October 19 9:00 - 10:15
W-1-101: Learning
Room 101
Chair: Manabu Kobayashi (Waseda University, Japan)
- Generalization Bounds for Deep Transfer Learning Using Majority Predictor Accuracy [ONLINE]
- Bayes Optimal Estimation and Its Approximation Algorithm for Difference with and without Treatment under URLC Model
- Two-dimensional Autoregressive Model with Time-varying Parameters and the Bayes Codes
W-1-102: Security and Coding
Room 102
Chair: Yasuyuki Murakami (Osaka Electro-Communication University, Japan)
- A Group-Type Distributed Secure Coded Computation Scheme Based on a Secret Sharing
- On the Optimal Construction of a Visual Cryptography Scheme for Multiple Secret Images
- A Security Enhanced Data Transmission Scheme Using Sequences Generated by Non-Systematic Reed-Solomon Coding
Wednesday, October 19 10:30 - 12:10
W-2-101: Coding Theory
Room 101
Chair: Takayuki Nozaki (Yamaguchi University, Japan)
- Improved Survival Probability for Coded Compressed Sensing in Unsourced Random Access
- A Group-Type Distributed Coded Computation Scheme Based on a Gabidulin Code
- Construction of reversible integer codes with large moduli via Chinese remainder theorem
- Hyperbolic Sets in Incomplete Tables
W-2-102: Security and Information Theory
Room 102
Chair: Mitsugu Iwamoto (The University of Electro-Communications, Japan)
- Unified expression of utility-privacy trade-off in privacy-constrained source coding
- A Framework for Distributed Source Coding with Encryption: a New Strong Converse and More
- Impact of Artificial Noise Assisted Transmission on the Physical Layer Security Performances in Wireless Wiretap Channel with Active Eavesdropper [ONLINE]
- The Relay Impact on the Physical Layer Security Performance of the Wireless Wiretap Channel [ONLINE]
Wednesday, October 19 12:10 - 12:40
W-PR-101: Poster Review 2 A
Room 101
- Geometric Representation and Optimum Weights of the BWSRM for Binary Mixed State Signals
- Towards the Construction of Quantum Error Correcting Codes for Multiple Insertion Errors
- Effects of Coding for CPPM-type Quantum Cipher
- Advance sharing of quantum shares for quantum secrets by EAQECC
W-PR-102: Poster Review 2 B
Room 102
- MQTT Communication and Data Capturing in Inventory Management Processes Based on Utilization of Drones and RFID technology
- Development of Suitable RFID Reader for Using onto Unmanned Aerial Vehicles
- Sparse Spatial Modulation Scheme Effective for Ultrafast Mobile Communications
- Enhancing Communication Services with Location and Sensing Information
Wednesday, October 19 14:00 - 14:30
Award Ceremony
Room 101
Wednesday, October 19 14:50 - 16:30
W-3-101: Applications and Quantum
Room 101
Chair: Tetsuya Kojima (National Institute of Technology, Tokyo College, Japan)
- A Modified MWPM Decoding Algorithm for Quantum Surface Codes over Depolarizing Channels
- Influence of Reflected Light in Illumination-Light VN-CodeSK Based Positioning Systems
- Iterative Model Identification and Tracking with Distributed Sensors
- PSK-type asymmetric quantum communication and its attenuation characteristics
W-3-102: Privacy
Room 102
Chair: Toyoo Takata (Iwate Prefectural University, Japan)
- Behavioral Authentication Method Focusing on the Tendency of the Days of the Week
- An analysis of password security risk against dictionary attacks
- An Improvement of Multi-Party Private Set Intersection Based on Oblivious Programmable PRFs
- Card-based Cryptographic Protocols for Private Set Intersection
Wednesday, October 19 16:45 - 18:00
W-4-101: Source Coding
Room 101
Chair: Jun Muramatsu (NTT Corporation, Japan)
- A Class of Data Compression Where The Codeword Is a Computer Program Generating The Data
- Lossy Source Coding of Binary Memoryless Source by Trained LDGM Encoder
- Sequential Change Detection through Empirical Distribution and Universal Codes