Cover Image

Bounds on $k$-hash distances and rates of linear codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Della Fiore, Stefano, Dalai, Marco
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
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)

Sharper upper bounds for $q$-ary and constant-weight $B_2$ codes
by: Della Fiore, Stefano
Published: (2026)

Pareto-type finite-block optimality for source codes: a constrained Markov example
by: Della Fiore, Stefano
Published: (2026)

Additive codes from linear codes
by: Ball, Simeon, et al.
Published: (2025)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)

On low-power error-correcting cooling codes with large distances
by: Zhao, Yuhao, et al.
Published: (2024)

Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)

On the existence of linear rank-metric intersecting codes
by: Borello, Martino, et al.
Published: (2026)

On the number of inequivalent linearized Reed-Solomon codes
by: Mannaert, Jonathan, et al.
Published: (2026)

On the weight distribution of random binary linear codes
by: Linial, Nati, et al.
Published: (2018)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, 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)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

The asymptotic number of equivalence classes of linear codes with given dimension
by: Di Giusto, Andrea, et al.
Published: (2025)

Rényi divergence guarantees for hashing with linear codes
by: Pathegama, Madhura, et al.
Published: (2024)

An Efficient Algorithm for Group Testing with Runlength Constraints
by: Dalai, Marco, et al.
Published: (2024)

Short rank-metric codes and scattered subspaces
by: Lia, Stefano, et al.
Published: (2023)

A further study on the mass formula for linear codes with prescribed hull dimension
by: Li, Shitao, et al.
Published: (2024)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
by: Abiad, Aida, et al.
Published: (2026)

New bounds for (weak) sequenceability in $\mathbb{Z}_k$
by: Costa, Simone, et al.
Published: (2026)

Variants of the Erdős distinct sums problem and variance method
by: Costa, Simone, et al.
Published: (2024)

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$
by: Leung, Ka Hin, et al.
Published: (2025)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

On the minimum Hamming distance between vectorial Boolean and affine functions
by: Nagy, Gabor P.
Published: (2025)

Shortest self-orthogonal embeddings of binary linear codes
by: An, Junmin, et al.
Published: (2025)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Latroids and code invariants
by: Gorla, Elisa, et al.
Published: (2025)

Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
by: Ozbudak, Ferruh, et al.
Published: (2024)

Graham conjecture on small sets in abelian groups
by: Costa, Simone, et al.
Published: (2026)

Nonvanishing $k$-flats of Boolean and vectorial functions
by: Kaspers, Christian
Published: (2026)

Error-detecting solid codes
by: Carruth, Nathan Thomas
Published: (2026)

On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
by: Stanovnik, Lidija, et al.
Published: (2024)

On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)

Storage codes on coset graphs with asymptotically unit rate
by: Barg, Alexander, et al.
Published: (2022)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

Quasi-optimal cyclic orbit codes
by: Castello, Chiara, et al.
Published: (2025)

Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)