Imagen de Portada

Counterexample to majority optimality in NICD with erasures

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ivanisvili, Paata, Xie, Xinyuan
Formato:	Preprint
Publicado:	2025
Materias:	Probability Computational Complexity Information Theory Combinatorics 68Q87, 94A15, 06E30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sharp isoperimetric inequalities on the Hamming cube II: The critical exponent
por: Durcik, Polona, et al.
Publicado: (2026)

Shift-invariant transformations and almost liftings
por: Haugland, Jan Kristian, et al.
Publicado: (2024)

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
por: Frydrych, Piotr
Publicado: (2026)

Covering the hypercube, the uncertainty principle, and an interpolation formula
por: Ivanisvili, Paata, et al.
Publicado: (2023)

Upper bounds on the numbers of binary plateaued and bent functions
por: Potapov, Vladimir N.
Publicado: (2023)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
por: Kumar, Mrinal, et al.
Publicado: (2018)

Polynomial Identity Testing via Evaluation of Rational Functions
por: Hu, Ivan, et al.
Publicado: (2022)

Jackson's inequality on the hypercube
por: Ivanisvili, Paata, et al.
Publicado: (2024)

On the Walsh spectra of quadratic APN functions
por: Bénéteau, Sophie Hannah, et al.
Publicado: (2025)

The Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
por: Abdollahi, A., et al.
Publicado: (2026)

The Optimality of a Nested Generalized Pairwise Group Testing Procedure
por: Malinovsky, Yaakov, et al.
Publicado: (2025)

The combinatorial structure and value distributions of plateaued functions
por: Kölsch, Lukas, et al.
Publicado: (2024)

Algebras of Information. An Axiomatic Foundation
por: Kohlas, Juerg
Publicado: (2017)

Changing almost perfect nonlinear functions on affine subspaces of small codimensions
por: Taniguchi, Hiroaki, et al.
Publicado: (2025)

How Does Machine Learning Manage Complexity?
por: Fortnow, Lance
Publicado: (2026)

Overconstrained character sums over finite abelian groups and decompositions of generalized bent, plateaued and landscape functions
por: Çeşmelioğlu, Ayça, et al.
Publicado: (2026)

A weak regularity lemma for polynomials
por: Moshkovitz, Guy, et al.
Publicado: (2025)

On the Low Weight Polynomial Multiple Problem
por: Ţiplea, Ferucio Laurenţiu, et al.
Publicado: (2024)

Computing the probability of intersection
por: Barvinok, Alexander
Publicado: (2025)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
por: Saffidine, Abdallah, et al.
Publicado: (2025)

A study of distributional complexity measures for Boolean functions
por: Köhler-Schindler, Laurin, et al.
Publicado: (2024)

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning
por: Zhang, Weikun K., et al.
Publicado: (2026)

On the power of iid information for linear approximation
por: Sonnleitner, Mathias, et al.
Publicado: (2023)

Identification over Permutation Channels
por: Sarkar, Abhishek, et al.
Publicado: (2024)

Characterization for a generic construction of bent functions and its consequences
por: Li, Yanjun, et al.
Publicado: (2023)

Grokability in five inequalities
por: Ivanisvili, Paata, et al.
Publicado: (2026)

Product Mixing in Compact Lie Groups
por: Ellis, David, et al.
Publicado: (2024)

Batch Array Codes
por: Kong, Xiangliang, et al.
Publicado: (2024)

Locally-APN Binomials with Low Boomerang Uniformity in Odd Characteristic
por: Koo, Namhun, et al.
Publicado: (2025)

Weight Distribution of the Weighted Coordinates Poset Block Space and Singleton Bound
por: Shriwastva, Atul Kumar, et al.
Publicado: (2025)

Random Walks, Faber Polynomials and Accelerated Power Methods
por: Cowal, Peter, et al.
Publicado: (2025)

Low-degree functions without non-essential arguments
por: Krotov, Denis S.
Publicado: (2024)

Geometric Characteristics and Stable Guarantees for Phaseless Operators and Structured Matrix Restoration
por: Huang, Gao, et al.
Publicado: (2024)

Recursions for quadratic rotation symmetric functions weights
por: Cusick, Thomas W.
Publicado: (2025)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
por: Lin, Tianrong
Publicado: (2023)

Discrete vs. Continuous Trade-offs for Generative Models
por: Korrapati, Jathin, et al.
Publicado: (2024)

On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3
por: Koo, Namhun, et al.
Publicado: (2026)

A new lower bound for deterministic pop-stack-sorting
por: Bauer, Morgan, et al.
Publicado: (2023)

The hereditariness problem for the Černý conjecture
por: Rodaro, Emanuele, et al.
Publicado: (2025)

Computational complexity of counting coincidences
por: Chan, Swee Hong, et al.
Publicado: (2023)