Saved in:
| Main Authors: | Li, Yanzhi, Zhong, Wenjie, Chen, Tingting, Zhang, Xiande |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.06556 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Quantitative Frameproof Codes and Hypergraphs
by: Zhong, Wenjie, et al.
Published: (2025)
by: Zhong, Wenjie, et al.
Published: (2025)
Reconstruction of hypermatrices from subhypermatrices
by: Zhang, Xiande, et al.
Published: (2024)
by: Zhang, Xiande, et al.
Published: (2024)
Trace reconstruction of matrices and hypermatrices
by: Zhong, Wenjie, et al.
Published: (2024)
by: Zhong, Wenjie, et al.
Published: (2024)
Improvements on Permutation Reconstruction from Minors
by: Ma, Yiming, et al.
Published: (2024)
by: Ma, Yiming, et al.
Published: (2024)
Improved upper bounds for wide-sense frameproof codes
by: Zhao, Yuhao, et al.
Published: (2024)
by: Zhao, Yuhao, et al.
Published: (2024)
Counting cliques with prescribed intersection sizes
by: Zhao, Yuhao, et al.
Published: (2025)
by: Zhao, Yuhao, et al.
Published: (2025)
On low-power error-correcting cooling codes with large distances
by: Zhao, Yuhao, et al.
Published: (2024)
by: Zhao, Yuhao, et al.
Published: (2024)
On set systems with strongly restricted intersections
by: Wei, Xin, et al.
Published: (2024)
by: Wei, Xin, et al.
Published: (2024)
On the Smallest Eigenvalues and Quantum Chromatic Numbers of Hamming Graphs and Generalizations
by: Ning, Yu, et al.
Published: (2026)
by: Ning, Yu, et al.
Published: (2026)
Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)
by: Huang, Xinqi, et al.
Published: (2024)
A Hypergraph Container Method on Spread SAT: Approximation and Speedup
by: Han, Zicheng, et al.
Published: (2026)
by: Han, Zicheng, et al.
Published: (2026)
Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)
by: Yang, Yulin
Published: (2026)
Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)
by: Ge, Gennian, et al.
Published: (2025)
Quantum Chromatic Number of Subgraphs of Orthogonality Graphs and the Distance-2 Hamming Graph
by: Luo, Tao, et al.
Published: (2025)
by: Luo, Tao, et al.
Published: (2025)
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)
by: Shangguan, Chong, et al.
Published: (2026)
Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)
by: Bhandari, Siddharth, et al.
Published: (2024)
Improved Lower Bounds for all Odd-Query Locally Decodable Codes
by: Basu, Arpon, et al.
Published: (2024)
by: Basu, Arpon, et al.
Published: (2024)
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
by: Hu, Sihuang, et al.
Published: (2025)
by: Hu, Sihuang, et al.
Published: (2025)
The Hilton-Milner type results of $(k, \ell)$-sum-free sets in $\mathbb F_p^n$
by: Wei, Xin, et al.
Published: (2025)
by: Wei, Xin, et al.
Published: (2025)
Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)
by: Langberg, Michael, et al.
Published: (2025)
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)
by: Con, Roni, et al.
Published: (2024)
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)
by: Chen, Yeyuan, et al.
Published: (2024)
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)
by: Hollmann, Henk D. L., et al.
Published: (2024)
Improved Bounds on Diffsequences with Gaps in Powers of 2
by: Talwar, Kanav, et al.
Published: (2025)
by: Talwar, Kanav, et al.
Published: (2025)
Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)
by: Wang, Chen, et al.
Published: (2026)
Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs
by: Dehgardi, Nasrin, et al.
Published: (2026)
by: Dehgardi, Nasrin, et al.
Published: (2026)
Improved Bounds for 3-Progressions
by: Raghavan, Rushil
Published: (2026)
by: Raghavan, Rushil
Published: (2026)
Improved Bounds for Szemerédi's Theorem
by: Leng, James, et al.
Published: (2024)
by: Leng, James, et al.
Published: (2024)
Improved Upper Bounds on the Pebbling Numbers of the Blanuša Snarks
by: Niu, Tong
Published: (2026)
by: Niu, Tong
Published: (2026)
Improved Bounds for the Freiman-Ruzsa Theorem
by: Raghavan, Rushil
Published: (2025)
by: Raghavan, Rushil
Published: (2025)
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)
Improved Lower Bound for Frankl's Union-Closed Sets Conjecture
by: Alweiss, Ryan, et al.
Published: (2022)
by: Alweiss, Ryan, et al.
Published: (2022)
Improved Lower Bound on the Number of Pseudoline Arrangements
by: Dallant, Justin
Published: (2024)
by: Dallant, Justin
Published: (2024)
New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)
by: Sarkar, Palash, et al.
Published: (2022)
An Improved Lower Bound for the de Bruijn--Erdős Consecutive Gap Problem
by: Korsky, Samuel
Published: (2026)
by: Korsky, Samuel
Published: (2026)
Lower Bounds on Tree Covers
by: Chen, Yu, et al.
Published: (2025)
by: Chen, Yu, et al.
Published: (2025)
Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
by: Li, Xin, et al.
Published: (2023)
by: Li, Xin, et al.
Published: (2023)
Bijective proof of a conjecture on unit interval posets
by: Fang, Wenjie
Published: (2022)
by: Fang, Wenjie
Published: (2022)
On the area-depth symmetry on Łukasiewicz paths
by: Fang, Wenjie
Published: (2026)
by: Fang, Wenjie
Published: (2026)
On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
by: Manurangsi, Pasin
Published: (2026)
by: Manurangsi, Pasin
Published: (2026)
Similar Items
-
Quantitative Frameproof Codes and Hypergraphs
by: Zhong, Wenjie, et al.
Published: (2025) -
Reconstruction of hypermatrices from subhypermatrices
by: Zhang, Xiande, et al.
Published: (2024) -
Trace reconstruction of matrices and hypermatrices
by: Zhong, Wenjie, et al.
Published: (2024) -
Improvements on Permutation Reconstruction from Minors
by: Ma, Yiming, et al.
Published: (2024) -
Improved upper bounds for wide-sense frameproof codes
by: Zhao, Yuhao, et al.
Published: (2024)