Sharper upper bounds for $q$-ary and constant-weight $B_2$ codes
Fuente:
arXiv
Saved in:
| Main Author: | Della Fiore, Stefano |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Upper bounds on the rate of linear $q$-ary $k$-hash codes
by: Della Fiore, Stefano, et al.
Published: (2024)
by: Della Fiore, Stefano, et al.
Published: (2024)
Pareto-type finite-block optimality for source codes: a constrained Markov example
by: Della Fiore, Stefano
Published: (2026)
by: Della Fiore, Stefano
Published: (2026)
Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)
by: Della Fiore, Stefano, et al.
Published: (2025)
New upper bounds on the number of non-zero weights of constacyclic codes
by: Chen, Li, et al.
Published: (2024)
by: Chen, Li, et al.
Published: (2024)
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)
by: Liang, Xue-Bin
Published: (2024)
$q$-ary Sequential Locally Recoverable Codes from the Product Construction
by: Baghban, Akram, et al.
Published: (2024)
by: Baghban, Akram, et al.
Published: (2024)
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
by: Pernice, Francisco, et al.
Published: (2024)
by: Pernice, Francisco, et al.
Published: (2024)
On Lattice Constructions D and D' from q-ary Linear Codes
by: Silva, Franciele do Carmo, et al.
Published: (2023)
by: Silva, Franciele do Carmo, et al.
Published: (2023)
Four classes of optimal p-ary cyclic codes
by: Fan, Jinmei, et al.
Published: (2025)
by: Fan, Jinmei, et al.
Published: (2025)
New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
by: Song, Wentu, et al.
Published: (2024)
by: Song, Wentu, et al.
Published: (2024)
A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)
by: Liu, Hengfeng, et al.
Published: (2025)
Several new classes of optimal p-ary cyclic codes
by: Fang, Mengen, et al.
Published: (2025)
by: Fang, Mengen, et al.
Published: (2025)
Improved upper bounds for wide-sense frameproof codes
by: Zhao, Yuhao, et al.
Published: (2024)
by: Zhao, Yuhao, et al.
Published: (2024)
A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)
by: Sarkar, Palash, et al.
Published: (2024)
Finite Field Multiple Access III: from 2-ary to p-ary
by: Yu, Qi-yue
Published: (2025)
by: Yu, Qi-yue
Published: (2025)
Some bounds on the cardinality of the $b$-symbol weight spectrum of codes
by: Zhu, Hongwei, et al.
Published: (2024)
by: Zhu, Hongwei, et al.
Published: (2024)
Approximate generalized Steiner systems and near-optimal constant weight codes
by: Liu, Miao, et al.
Published: (2024)
by: Liu, Miao, et al.
Published: (2024)
Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths
by: Yang, Zhiye, et al.
Published: (2026)
by: Yang, Zhiye, et al.
Published: (2026)
Constrained coding upper bounds via Goulden-Jackson cluster theorem
by: Shen, Yuanting, et al.
Published: (2024)
by: Shen, Yuanting, et al.
Published: (2024)
Stiefel manifolds and upper bounds for spherical codes and packings
by: Zargar, Masoud
Published: (2024)
by: Zargar, Masoud
Published: (2024)
$\mathbb{F}_q\mathbb{F}_{q^2}$-additive cyclic codes and their Gray images
by: Yadav, Ankit, et al.
Published: (2025)
by: Yadav, Ankit, et al.
Published: (2025)
Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
by: Tsui, Darin, et al.
Published: (2025)
by: Tsui, Darin, et al.
Published: (2025)
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)
by: Baghban, Akram, et al.
Published: (2025)
Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods
by: Taheri, Hossein, et al.
Published: (2024)
by: Taheri, Hossein, et al.
Published: (2024)
New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
by: Kiermaier, Michael, et al.
Published: (2015)
by: Kiermaier, Michael, et al.
Published: (2015)
Five-Lee-weight linear codes over $\mathbb{F}_{q}+u\mathbb{F}_{q}$
by: Kumar, Pavan, et al.
Published: (2024)
by: Kumar, Pavan, et al.
Published: (2024)
An Efficient Algorithm for Group Testing with Runlength Constraints
by: Dalai, Marco, et al.
Published: (2024)
by: Dalai, Marco, et al.
Published: (2024)
Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
by: Gupta, Shivam, et al.
Published: (2023)
by: Gupta, Shivam, et al.
Published: (2023)
Multilevel inserting constructions for constant dimension subspace codes
by: Wang, Gang, et al.
Published: (2025)
by: Wang, Gang, et al.
Published: (2025)
On the rank weight hierarchy of $M$-codes
by: Berhuy, G., et al.
Published: (2025)
by: Berhuy, G., et al.
Published: (2025)
Several classes of BCH codes of length $n=\frac{q^{m}-1}{2}$
by: Lian, Mengchen
Published: (2024)
by: Lian, Mengchen
Published: (2024)
The weight hierarchies of three classes of linear codes
by: Lu, Wei, et al.
Published: (2024)
by: Lu, Wei, et al.
Published: (2024)
Two-weight rank-metric codes
by: Zullo, Ferdinando, et al.
Published: (2024)
by: Zullo, Ferdinando, et al.
Published: (2024)
$m$-adic residue codes over $\mathbb{F}_q[v]/(v^s-v)$ and their application to quantum codes
by: Kuruz, Ferhat, et al.
Published: (2018)
by: Kuruz, Ferhat, et al.
Published: (2018)
An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)
by: Landjev, Ivan, et al.
Published: (2025)
Binary duadic codes and their related codes with a square-root-like lower bound
by: Wu, Tingting, et al.
Published: (2024)
by: Wu, Tingting, et al.
Published: (2024)
Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
by: Xu, Dengming, et al.
Published: (2025)
by: Xu, Dengming, et al.
Published: (2025)
On $3$-dimensional MRD codes of type $\langle x^{q^t},x+δx^{q^{2t}},G(x) \rangle$
by: Bartoli, Daniele, et al.
Published: (2024)
by: Bartoli, Daniele, et al.
Published: (2024)
Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)
by: Kurz, Sascha, et al.
Published: (2026)
One-weight codes in the sum-rank metric
by: Mushrraf, Usman, et al.
Published: (2025)
by: Mushrraf, Usman, et al.
Published: (2025)
Similar Items
-
Upper bounds on the rate of linear $q$-ary $k$-hash codes
by: Della Fiore, Stefano, et al.
Published: (2024) -
Pareto-type finite-block optimality for source codes: a constrained Markov example
by: Della Fiore, Stefano
Published: (2026) -
Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025) -
New upper bounds on the number of non-zero weights of constacyclic codes
by: Chen, Li, et al.
Published: (2024) -
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)