Cover Image

Constrained coding upper bounds via Goulden-Jackson cluster theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shen, Yuanting, Shangguan, Chong, Lin, Zhicong, Ge, Gennian
Format:	Preprint
Published:	2024
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When can an expander code correct $Ω(n)$ errors in $O(n)$ time?
by: Cheng, Kuan, et al.
Published: (2023)

New results on sparse representations in unions of orthonormal bases
by: Zhang, Tao, et al.
Published: (2024)

Approximate generalized Steiner systems and near-optimal constant weight codes
by: Liu, Miao, et al.
Published: (2024)

Near optimal constructions of frameproof codes
by: Liu, Miao, et al.
Published: (2024)

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
by: Xi, Yuanxiao, et al.
Published: (2025)

Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)

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

Improved upper bounds for wide-sense frameproof codes
by: Zhao, Yuhao, et al.
Published: (2024)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

Stiefel manifolds and upper bounds for spherical codes and packings
by: Zargar, Masoud
Published: (2024)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)

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)

Private Information Retrieval over Graphs
by: Ge, Gennian, et al.
Published: (2025)

Eigenvalue bounds and alternating rank-metric codes
by: Abiad, Aida, et al.
Published: (2024)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
by: Sason, Igal
Published: (2025)

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

Semidefinite lower bounds for covering codes
by: Gijswijt, Dion, et al.
Published: (2025)

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

Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
by: Ball, Simeon, et al.
Published: (2024)

Monimial Matrix Analogue of Yoshida's theorem
by: Chakraborty, Ananda
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)

An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)

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)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

On perfect symmetric rank-metric codes
by: Mushrraf, Usman, et al.
Published: (2024)

Two-weight rank-metric codes
by: Zullo, Ferdinando, et al.
Published: (2024)

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

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

Codes with restricted overlaps: expandability, constructions, and bounds
by: Stanovnik, Lidija
Published: (2024)

Generalized Goulden-Yong duals and signed minimal factorizations
by: Chen, Shujian, et al.
Published: (2023)

Binary codes from subset inclusion matrices
by: Marin, Alexey D., et al.
Published: (2024)

Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)

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

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

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

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