:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Baghban, Akram, Ghiyasvand, Mehdi
Format:	Preprint
Published:	2025
Subjects:	Information Theory H.1.1
Online Access:	https://arxiv.org/abs/2503.02001
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
by: Baghban, Akram, et al.
Published: (2024)

Digit-Indexed q-ary SEC-DED Codes with Near-Hamming Overhead
by: Hu, Jiaxu, et al.
Published: (2025)

Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)

Amortized Locally Decodable Codes
by: Blocki, Jeremiah, et al.
Published: (2025)

Lagrangians, Renormalization, and Quantization in Prefix Coding
by: Kolpakov, Alexander, et al.
Published: (2025)

Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
by: Cohen, Tomer, et al.
Published: (2025)

Towards a Theory of Pragmatic Information
by: Weinberger, Edward D.
Published: (2024)

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2023)

Timely NextG Communications with Decoy Assistance against Deep Learning-based Jamming
by: Costa, Maice, et al.
Published: (2024)

Huygens-Fresnel Model Based Position-Aided Phase Configuration for 1-Bit RIS Assisted Wireless Communication
by: Zheng, Xiao, et al.
Published: (2024)

Extremal Mechanisms for Pointwise Maximal Leakage
by: Grosse, Leonhard, et al.
Published: (2023)

Composition Theorems for Multiple Differential Privacy Constraints
by: Cadir, Cemre, et al.
Published: (2026)

Equivalence of Informations Characterizes Bregman Divergences
by: Chodrow, Philip S.
Published: (2025)

All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)

Empirical coordination in the finite blocklength regime: an achievability result---Extended version
by: Massicot, Olivier, et al.
Published: (2026)

On the Complexity of the Conditional Independence Implication Problem With Bounded Cardinalities
by: Makowski, Michał
Published: (2024)

Multiplicative Turing Ensembles, Pareto's Law, and Creativity
by: Kolpakov, Alexander, et al.
Published: (2025)

Timeliness in NextG Spectrum Sharing under Jamming Attacks with Deep Learning
by: Costa, Maice, et al.
Published: (2024)

A Model-Driven Lossless Compression Algorithm Resistant to Mismatch
by: Hu, Cordelia, et al.
Published: (2026)

Binary cyclic codes from permutation polynomials over $\mathbb{F}_{2^m}$
by: Bose, Mrinal Kanti, et al.
Published: (2025)

Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems
by: Hong, Jordan, et al.
Published: (2025)

Quantifying Privacy via Information Density
by: Grosse, Leonhard, et al.
Published: (2024)

A Family of LZ78-based Universal Sequential Probability Assignments
by: Sagan, Naomi, et al.
Published: (2024)

Benford's Law from Turing Ensembles and Integer Partitions
by: Kolpakov, Alexander, et al.
Published: (2025)

A Tsallis-Entropy Lens on Genetic Variation
by: Geleta, Margarita, et al.
Published: (2025)

On the hull and complementarity of one generator quasi-cyclic codes and four-circulant codes
by: Aliabadi, Zohreh, et al.
Published: (2023)

Why Eight Percent of Benford Sequences Never Converge
by: Hyman, James M.
Published: (2026)

Sequential Change Detection Under Markov Setup With Unknown Prechange And Postchange Distributions
by: Gulaguli, Ashish Bhoopesh, et al.
Published: (2025)

Personalization of Dataset Retrieval Results using a Metadata-based Data Valuation Method
by: Ebiele, Malick, et al.
Published: (2024)

Maximally Extendable Sheaf Codes
by: Panteleev, Pavel, et al.
Published: (2024)

The problem of infinite information flow
by: Bian, Zheng, et al.
Published: (2025)

Generalized Fractional Repetition Codes for Binary Coded Computations
by: Charalambides, Neophytos, et al.
Published: (2021)

3D Data Long-Term Preservation in Cultural Heritage
by: Amico, Nicola, et al.
Published: (2024)

Ranking by Momentum based on Pareto ordering of entities
by: Imielinski, Tomasz
Published: (2021)

The Limits of AI Explainability: An Algorithmic Information Theory Approach
by: Rao, Shrisha
Published: (2025)

Adaptive Greedy Rejection Sampling
by: Flamich, Gergely, et al.
Published: (2023)

An Analysis of XML Compression Efficiency
by: Augeri, Christopher James, et al.
Published: (2024)

On Codes over Eisenstein Integers
by: Hadi, Abdul, et al.
Published: (2024)

Architecture of Information
by: Parzhyn, Yurii
Published: (2025)

Data accounting and error counting
by: Gajda, Michał J.
Published: (2023)