| 1. |
- Erkip, Elza, et al.
(författare)
-
Editorial Issue on 'Information Theoretic Foundations of Future Communication Systems'
- 2022
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 3:1, s. 2-4
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- Information theory, starting with Shannon’s groundbreaking work, has fundamentally shaped the way communication systems are designed and operated. Information theoretic principles form the underpinnings of modern communication networks. This issue explores how new advances in information theory can impact future communication systems. Several papers address issues at the heart of next generation wireless and wired networks: Multiple access, including access by a massive number of devices, multi-hop, large antenna arrays, communication security, and timeliness of information. Others consider new applications such as joint communication and sensing, communication for learning and inference, wireless imaging, and new storage mediums such as DNA, thereby providing the information theoretic foundations of modalities beyond human-to-human communications.
|
|
| 2. |
- Ghourchian, Hamid, et al.
(författare)
-
Secure Block Source Coding With Sequential Encoding
- 2021
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - : IEEE. - 2641-8770. ; 2:1
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce fundamental bounds on achievable cumulative rate distribution functions (CRDF) to characterize a sequential encoding process that ensures lossless or lossy reconstruction subject to an average distortion criterion using a non-causal decoder. The CRDF describes the rate resources spent sequentially to compress the sequence. We also include a security constraint that affects the set of achievable CRDF. The information leakage is defined sequentially based on the mutual information between the source and its compressed representation, as it evolves. To characterize the security constraints, we introduce the concept of cumulative leakage distribution functions (CLF), which determines the allowed information leakageas distributed over encoded sub-blocks. Utilizing tools from majorization theory, we derive necessary and sufficient conditions on the achievable CRDF for a given independent and identically distributed (IID) source and CLF. One primary result of this article is that the concave-hull of the CRDF characterizes the optimal achievable rate distribution.
|
|
| 3. |
- Hellström, Fredrik, 1993, et al.
(författare)
-
Generalization Bounds via Information Density and Conditional Information Density
- 2020
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 1:3, s. 824-839
-
Tidskriftsartikel (refereegranskat)abstract
- We present a general approach, based on an exponential inequality, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds on its tail probability, for both the PAC-Bayesian and single-draw scenarios. Specifically, for the case of sub-Gaussian loss functions, we obtain novel bounds that depend on the information density between the training data and the output hypothesis. When suitably weakened, these bounds recover many of the information-theoretic bounds available in the literature. We also extend the proposed exponential-inequality approach to the setting recently introduced by Steinke and Zakynthinou (2020), where the learning algorithm depends on a randomly selected subset of the available training data. For this setup, we present bounds for bounded loss functions in terms of the conditional information density between the output hypothesis and the random variable determining the subset choice, given all training data. Through our approach, we recover the average generalization bound presented by Steinke and Zakynthinou (2020) and extend it to the PAC-Bayesian and singledraw scenarios. For the single-draw scenario, we also obtain novel bounds in terms of the conditional α-mutual information and the conditional maximal leakage.
|
|
| 4. |
- Lin, Hsuan Yin, et al.
(författare)
-
The Capacity of Single-Server Weakly-Private Information Retrieval
- 2021
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 2:1, s. 415-427
-
Tidskriftsartikel (refereegranskat)abstract
- A private information retrieval (PIR) protocol guar- antees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file. Existing information-theoretic PIR proto- cols ensure perfect privacy, i.e., zero information leakage to the servers storing the database, but at the cost of high download. In this work, we present weakly-private information retrieval (WPIR) schemes that trade off perfect privacy to improve the download cost when the database is stored on a single server. We study the tradeoff between the download cost and information leakage in terms of mutual information (MI) and maximal leak- age (MaxL) privacy metrics. By relating the WPIR problem to rate-distortion theory, the download-leakage function, which is defined as the minimum required download cost of all single- server WPIR schemes for a given level of information leakage and a fixed file size, is introduced. By characterizing the download- leakage function for the MI and MaxL metrics, the capacity of single-server WPIR is fully described.
|
|
| 5. |
- Pook-Kolb, Daniel, et al.
(författare)
-
The Voronoi Region of the Barnes-Wall Lattice Λ16
- 2023
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 4, s. 16-23
-
Tidskriftsartikel (refereegranskat)abstract
- We give a detailed description of the Voronoi region of the Barnes–Wall lattice $\Lambda _{16}$ , including its vertices, relevant vectors, and symmetry group. The exact value of its quantizer constant is calculated, which was previously only known approximately. To verify the result, we estimate the same constant numerically and propose a new very simple method to quantify the variance of such estimates, which is far more accurate than the commonly used jackknife estimator.
|
|
| 6. |
- Zhou, Linghui, et al.
(författare)
-
Two-Stage Biometric Identification Systems without Privacy Leakage
- 2021
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - : IEEE. - 2641-8770.
-
Tidskriftsartikel (refereegranskat)abstract
- We study two-stage biometric identification systems that allow authentication without privacy leakage. In the enrollment phase, secret keys and two layers of the helper data for each user are generated. Additional to the helper data and secret keys, we also introduce private keys in the systems. In the identification phase, an unknown but previously enrolled user is observed, and the user's private key is also presented to the system. The system firstly compares the user with the first layer helper database, outputs a list, and obtains a set of user indices. Then the system compares the observed user with the users in the set. Therefore, the identification procedure avoids an exhaustive search and only has to do a comparison with some part of the users in the system, which leads to a systematic reduction of the search complexity. Fundamental trade-offs among the identification rate, the secret key rate, the private key rate, the helper data rate, and the list size rate are derived in the imposed two-stage biometric identification systems without privacy leakage. Moreover, the obtained results show that a private key can boost the identification rate and the secret key rate, as well as preserve privacy.
|
|
| 7. |
- Zhu, Min, et al.
(författare)
-
Error Propagation Mitigation in Sliding Window Decoding of Spatially Coupled LDPC Codes
- 2023
-
Ingår i: IEEE Journal on Selected Areas in Information Theory. - 2641-8770. ; 4, s. 470-486
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we investigate the problem of decoder error propagation for spatially coupled low-density parity-check (SC-LDPC) codes with sliding window decoding (SWD). This problem typically manifests itself at signal-to-noise ratios (SNRs) close to capacity under low-latency operating conditions. In this case, infrequent but severe decoder error propagation can sometimes occur. To help understand the error propagation problem in SWD of SC-LDPC codes, a multi-state Markov model is developed to describe decoder behavior and to analyze the error performance of SC-LDPC codes under these conditions. We then present two approaches - check node (CN) doping and variable node (VN) doping - to combating decoder error propagation and improving decoder performance. Next we describe how the performance can be further improved by employing an adaptive approach that depends on the availability of a noiseless binary feedback channel. To illustrate the effectiveness of the doping techniques, we analyze the error performance of CN doping and VN doping using the multi-state decoder model. We then present computer simulation results showing that CN and VN doping significantly improve the performance in the operating range of interest at a cost of a small rate loss and that adaptive doping further improves the performance. We also show that the rate loss is always less than that resulting from encoder termination and can be further reduced by doping only a fraction of the VNs at each doping position in the code graph with only a minor impact on performance. Finally, we show how the encoding problem for VN doping can be greatly simplified by doping only systematic bits, with little or no performance loss.
|
|
