Cover Image

On the Hardness of the One-Sided Code Sparsifier Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grigorescu, Elena, Moayyedi, Alice
Format:	Preprint
Published:	2025
Subjects:	Information Theory E.4; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Markov-Chain Polytope with Applications
by: Golin, Mordecai J., et al.
Published: (2024)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
by: Jia, Chenyuan, et al.
Published: (2025)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
by: Riis, Søren
Published: (2026)

Highway to Hull: An Algorithm for Solving the General Matrix Code Equivalence Problem
by: Couvreur, Alain, et al.
Published: (2025)

Sublime: Sublinear Error & Space for Unbounded Skewed Streams
by: Eslami, Navid, et al.
Published: (2026)

Tokenizations for Austronesian Language Models: study on languages in Indonesia Archipelago
by: Lumbantobing, Andhika Bernard, et al.
Published: (2026)

Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
by: Brault, Gregory J., et al.
Published: (2024)

Greedy Poisson Rejection Sampling
by: Flamich, Gergely
Published: (2023)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
by: Schmid, Markus L.
Published: (2019)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
by: Goldberg, Guy, et al.
Published: (2025)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
by: de Rezende, Susanna F., et al.
Published: (2024)

Tunnel Geometry and Proliferation Logic: A Strict Categorical Equivalence
by: Sukhov, Dmytro
Published: (2025)

Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)

Adaptive Engram Memory System for Indonesian Language Model: Generative AI Based on TOBA LM for Batak and Minang Language
by: Situngkir, Hokky, et al.
Published: (2026)

Syllabic Agglutinative Tokenizations for Indonesian LLM: A Study from Gasing Literacy Learning System
by: Situngkir, H., et al.
Published: (2026)

Tensor Manifold-Based Graph-Vector Fusion for AI-Native Academic Literature Retrieval
by: Wei, Xing, et al.
Published: (2026)

Practical implementation of geometric quasi-cyclic LDPC codes
by: Ball, Simeon, et al.
Published: (2024)

MISES: Minimal Information Sufficiency for Effective Service
by: Armstrong, Joss
Published: (2026)

Why distinctiveness centrality is distinctive
by: Colladon, A. Fronzetti, et al.
Published: (2024)

Multidimensional Budget-Feasible Mechanism Design
by: Neogi, Rian, et al.
Published: (2025)

Subsequence Matching and Analysis Problems for Formal Languages
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

Community Detection using Fortunato's Performance Measure
by: Thakar, Srushti, et al.
Published: (2025)

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
by: Baumann, Jakob, et al.
Published: (2024)

The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)

Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

Heaven & Hell: One-Step Hub Consensus
by: Aghanya, Nnamdi Daniel
Published: (2025)

A 67%-Rate CSS Code on the FCC Lattice: [[192,130,3]] from Weight-12 Stabilizers
by: Kulkarni, Raghu
Published: (2026)

Pauli measurements are not optimal for single-copy tomography
by: Acharya, Jayadev, et al.
Published: (2025)

Mining and Intervention of Social Networks Information Cocoon Based on Multi-Layer Network Community Detection
by: Yang, Suwen, et al.
Published: (2025)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)

Extremal Separation Problems for Temporal Instance Queries
by: Jung, Jean Christoph, et al.
Published: (2024)

Incremental Selection of Most-Filtering Conjectures and Proofs of the Selected Conjectures
by: Ngouonou, Jovial Cheukam, et al.
Published: (2025)

Forbidden cycles in metrically homogeneous graphs
by: Hubička, Jan, et al.
Published: (2018)

Resource theory of asymmetric distinguishability with partial information
by: Yao, Siqi, et al.
Published: (2025)

Universal Shuffle Asymptotics: Sharp Privacy Analysis in the Gaussian Regime
by: Shvets, Alex
Published: (2026)