


default search action
ITW 2023: Saint-Malo, France
- IEEE Information Theory Workshop, ITW 2023, Saint-Malo, France, April 23-28, 2023. IEEE 2023, ISBN 979-8-3503-0149-6

- Anna-Lena Horlemann

, Violetta Weger
, Nadja Willenborg:
On the Density of Codes over Finite Chain Rings. 1-6 - Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh, Moshe Schwartz:

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix. 7-12 - Mahdi Bayanifar, A. Robert Calderbank, Olav Tirkkonen:

Performance Analysis of Binary Chirp Decoding. 13-18 - Mohammad Mahdi Mahvari, Gerhard Kramer:

Stability of Bernstein's Characterization of Gaussian Vectors and a Soft Doubling Argument. 19-23 - K. Nithin Varma, Krishna P. Jagannathan:

An Erasure Queue-Channel with Feedback: Optimal Transmission Control to Maximize Capacity. 24-29 - Khaled Eldowa

, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. 30-35 - Charles Pillet, Valerio Bioglio, Pascal Giard:

On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble Decoding. 36-41 - Habibul Islam

, Anna-Lena Horlemann
:
Galois Hull Dimensions of Gabidulin Codes. 42-46 - José Joaquín Bernal

, Juan Jacobo Simón:
Hyperbolic Sets in Incomplete Tables. 47-52 - Anelia Somekh-Baruch:

An Upper Bound on the Reliability Function of the DMC with or without Mismatch. 53-58 - Reza Khosravi-Farsani, Wei Yu:

Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders. 59-63 - Photios A. Stavrou, Marios Kountouris

:
Goal-Oriented Single-Letter Codes for Lossy Joint Source-Channel Coding. 64-69 - Freja Elbro

, Christian Majenz
:
An Algebraic Attack Against McEliece-like Cryptosystems Based on BCH codes. 70-75 - Vladimir Edemskiy

, Sofia Koltsova:
Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation. 76-80 - Yi Liu, Julien Béguinot, Wei Cheng, Sylvain Guilley, Loïc Masure, Olivier Rioul, François-Xavier Standaert:

Improved Alpha-Information Bounds for Higher-Order Masked Cryptographic Implementations. 81-86 - Hila Ratson, Ram Zamir:

Rate-Distortion in Non-Convex Families. 87-91 - Shitong Wu

, Wenhao Ye, Hao Wu, Huihui Wu, Wenyi Zhang, Bo Bai:
A Communication Optimal Transport Approach to the Computation of Rate Distortion Functions. 92-96 - Nicolas Charpenay, Maël Le Treust, Aline Roumy:

Optimal Zero-Error Coding for Computing under Pairwise Shared Side Information. 97-101 - Sung-Hyuk Pang, Alban Goupil, Valeriu Vrabie, Loïc Kolodziejczak:

Recurrent Variational Information Bottleneck for Time Series Trend Prediction. 102-106 - Vincent Corlay, Jean-Christophe Sibel

:
Minimizing the Outage Probability in a Markov Decision Process. 107-112 - Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:

Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial Attacks. 113-118 - Elizabath Peter, K. K. Krishnan Namboodiri

, B. Sundar Rajan:
Coded Caching with Shared Caches and Private Caches. 119-124 - Kanishak Vaidya, B. Sundar Rajan:

Cache-Aided Multi-User Private Information Retrieval using PDAs. 125-130 - Niladri Das

, B. Sundar Rajan:
A Shared Cache Coded Caching Scheme Using Designs and Circuits of Matrices. 131-135 - Michail Gkagkos, Krishna R. Narayanan, Jean-François Chamberland

, Costas N. Georghiades:
PolarAir: A Compressed Sensing Scheme for Over-the-Air Federated Learning. 136-141 - Yaniv Fogel, Meir Feder:

Permutation Invariant Individual Batch Learning. 142-146 - Lantian Wei, Shan Lu, Hiroshi Kamabe:

BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh Fading. 147-152 - Charul Rajput

, B. Sundar Rajan:
On Cache-aided Multi-user Private Information Retrieval with Small Caches. 153-158 - K. K. Krishnan Namboodiri

, B. Sundar Rajan:
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement. 159-164 - Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:

The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache Size. 165-169 - Joseph M. Renes

:
Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels. 170-174 - Hari Hara Suthan Chittoor, Osvaldo Simeone, Leonardo Banchi, Stefano Pirandola:

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels. 175-180 - Serhat Bakirtas

, Elza Erkip:
Database Matching Under Adversarial Column Deletions. 181-185 - Maiara F. Bollauf

, Hsuan-Yin Lin, Øyvind Ytrehus:
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. 186-191 - Okko Makkonen

, Camilla Hollanti
:
Secure Distributed Gram Matrix Multiplication. 192-197 - Sergey Loyka, Neri Merhav:

The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder. 198-202 - Ludovico Lami, Bartosz Regula

, Xin Wang
, Mark M. Wilde:
Upper Bounds on the Distillable Randomness of Bipartite Quantum States. 203-208 - Yunos El Kaderi, Andreas Honecker

, Iryna Andriyanova:
Performance of Uncoded Implementation of Grover's Algorithm on Today's Quantum Processors. 209-214 - Sisi Miao, Alexander Schnerring, Haizheng Li, Laurent Schmalen:

Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices. 215-220 - Luis Maßny, Antonia Wachter-Zeh:

Secure Over-the-Air Computation Using Zero-Forced Artificial Noise. 221-226 - Shoichi Hirose

, Junji Shikata:
Group-Testing Aggregate Entity Authentication. 227-231 - Jyotish Robin, Elza Erkip:

Active User Identification in Fast Fading Massive Random Access Channels. 232-237 - Alain Couvreur:

Improved decoding of symmetric rank metric errors. 238-242 - Sebastian Bitzer, Julian Renner, Antonia Wachter-Zeh, Violetta Weger

:
Generic Decoding in the Cover Metric. 243-247 - Ermes Franch, Philippe Gaborit, Chunlei Li:

Generalized low rank parity check codes. 248-253 - Marcel Fernandez, Grigory Kabatiansky, Sebastià Martín, Cédric Tavernier:

A constructive approach to multimedia codes with complete traceability resistant to δ-noise. 254-259 - Rémi A. Chou

, Matthieu R. Bloch:
Retractable Commitment over Noisy Channels. 260-265 - Cécile Bouette

, Laura Luzzi, Ligong Wang:
Covert Communication over Two Types of Additive Noise Channels. 266-271 - Ran Tamir, Neri Merhav:

Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels. 272-276 - Sara Faour, Mustapha Hamad, Mireille Sarkiss

, Michèle A. Wigger:
Testing Against Independence with an Eavesdropper. 277-282 - Lan V. Truong, Albert Guillén i Fàbregas:

Concentration Properties of Generalized Random Gilbert-Varshamov Codes. 283-287 - Huihui Wu, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:

Lossy Compression via Sparse Regression Codes: An Approximate Message Passing Approach. 288-293 - Yizhou Xu, TianQi Hou, Shansuo Liang, Marco Mondelli:

Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models. 294-298 - Christo Kurisummoottil Thomas, Zilu Zhao, Dirk Slock:

Towards Convergent Approximate Message Passing by Alternating Constrained Minimization of Bethe Free Energy. 299-304 - Ke Wang, Zhifang Zhang:

Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r. 305-310 - Zhe Zhai, Qifu Tyler Sun, Sheng Jin, Shaoteng Liu, Xiangyu Chen:

New Construction of (k + r,k) Systematic MDS Array Codes with r ≤ 4. 311-316 - Hoover H. F. Yin

, Xishi Wang:
Multichannel Dual Codes: The Choice of Channels Carries Information. 317-322 - Damien Barbier, Carlo Lucibello

, Luca Saglietti, Florent Krzakala
, Lenka Zdeborová:
Compressed sensing with ℓ0-norm: statistical physics analysis & algorithms for signal recovery. 323-328 - Hui-An Shen

, Stefan M. Moser, Jean-Pascal Pfister:
A Generalization of the Equal Coding Theorem. 329-334 - Karim T. Abou-Moustafa:

Shrinkage Coefficient Estimation for Regularized Tyler's M-Estimator: A Leave One Out Approach. 335-340 - Joseph Griffin, Peihong Yuan, Petar Popovski

, Ken R. Duffy
, Muriel Médard:
Code at the Receiver, Decode at the Sender: GRAND with Feedback. 341-346 - Anina Gruica, Benjamin Jany, Alberto Ravagnani:

Duality and LP Bounds for Codes with Locality. 347-352 - Muris Spahovic, Mohammad Javad Salariseddigh, Christian Deppe:

Deterministic K-Identification For Slow Fading Channels. 353-358 - Sarthak Jain, Martina Cardone, Soheil Mohajer:

Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable Items. 359-364 - Antoine Bodin, Nicolas Macris:

Gradient flow on extensive-rank positive semi-definite matrix denoising. 365-370 - Farhad Shirani, Mohsen Heidari:

On Non-Interactive Source Simulation via Fourier Transform. 371-376 - Issam Maarouf, Eirik Rosnes, Alexandre Graell i Amat:

Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel. 377-382 - Lorenz Welter, Issam Maarouf, Andreas Lenz, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat:

Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel. 383-388 - Yonatan Yehezkeally

, Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh:
Bounds on Mixed Codes with Finite Alphabets. 389-394 - Benjamin M. Zaidel, Chen Eger, Shlomo Shamai Shitz:

Sparse NOMA: An Achievable Region via Random Coordinate Transformations. 395-400 - Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund:

Multi-User Privacy Mechanism Design with Non-zero Leakage. 401-405 - Shubham K. Jha, Prathamesh Mayekar:

Fundamental Limits of Distributed Optimization over Multiple Access Channel. 406-411 - Ayman Zahr, Balázs Matuz, Gianluigi Liva:

Rate-Adaptive Protograph MacKay-Neal Codes. 412-417 - Anjana Ambika Mahesh, Charul Rajput

, Bobbadi Rupa, B. Sundar Rajan:
Average Probability of Error for Single Uniprior Index Coding over Rayleigh Fading Channel. 418-423 - Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, Romain Lebreton:

Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes. 424-429 - Siyao Li

, Giuseppe Caire:
On the State Estimation Error of "Beam-Pointing" Channels: The Binary Case. 430-434 - Vincent Corlay, Hamidou Dembélé:

A modified probabilistic amplitude shaping scheme to use sign-bit-like shaping with a BICM. 435-439 - Elham Anarakifirooz, Sergey Loyka:

Robustness of Massive MIMO to Location and Phase Errors. 440-444 - Ashirwad Sinha, Praful D. Mankar, Nikolaos Pappas, Harpreet S. Dhillon:

Age of Information with On-Off Service. 445-450 - Shubhransh Singhvi, Praful D. Mankar:

Coding Gain for Age of Information in a Multi-source System with Erasure Channel. 451-456 - Khodor Safa, Raul de Lacerda, Sheng Yang:

Channel Estimation and Data Detection in MIMO channels with 1-bit ADC using Probit Regression. 457-461 - Meng-Che Chang, Shi-Yuan Wang, Matthieu R. Bloch:

Sequential Joint Communication and Sensing of Fixed Channel States. 462-467 - Wilton Kim, Stanislav Kruglik

, Han Mao Kiah:
Coded Computation of Multiple Functions. 468-473 - Federico Brunero, Kai Wan, Giuseppe Caire, Petros Elia:

Coded Distributed Computing for Sparse Functions With Structured Support. 474-479 - Haoyang Hu, Songze Li, Minquan Cheng, Youlong Wu:

Coded Distributed Computing for Hierarchical Multi-task Learning. 480-485 - Giuseppe Cocco, Andrea Munari, Gianluigi Liva:

State Estimation Entropy for Two-State Markov Sources in Slotted ALOHA Random Access Channels. 486-491 - Ran Tamir:

Entropy Rate Bounds of Integer-Valued Processes via Second-Order Statistics. 492-496 - Ioannis Papageorgiou, Ioannis Kontoyiannis:

Truly Bayesian Entropy Estimation. 497-502 - Jakob Maier, Laurent Massoulié:

Asymmetric tree correlation testing for graph alignment. 503-508 - Ali Khalesi, Sajad Daei, Marios Kountouris

, Petros Elia:
Multi-User Distributed Computing Via Compressed Sensing. 509-514 - Marian Temprana Alonso, Farhad Shirani, S. Sitharama Iyengar:

Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms. 515-520 - Jun Muramatsu

:
Channel Codes for Relayless Networks with General Message Access Structure. 521-525 - Christopher Hojny, Altan Berdan Kilic, Alberto Ravagnani:

The Role of the Alphabet in Network Coding: An Optimization Approach. 526-531 - Sharu Theresa Jose, Osvaldo Simeone:

Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization Analysis. 532-537 - Xujun Liu, Olgica Milenkovic, George V. Moustakides:

A Combinatorial Proof for the Dowry Problem. 538-543 - Marco Dalai

, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures. 544-549

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














