Imagen de Portada

Improved upper bounds for wide-sense frameproof codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhao, Yuhao, Zhang, Xiande
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Constrained coding upper bounds via Goulden-Jackson cluster theorem
por: Shen, Yuanting, et al.
Publicado: (2024)

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

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

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
por: Kiermaier, Michael, et al.
Publicado: (2015)

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

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

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
por: Abiad, Aida, et al.
Publicado: (2024)

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

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

Counting cliques with prescribed intersection sizes
por: Zhao, Yuhao, et al.
Publicado: (2025)

Additive codes from linear codes
por: Ball, Simeon, et al.
Publicado: (2025)

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

Latroids and code invariants
por: Gorla, Elisa, et al.
Publicado: (2025)

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

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

Error-detecting solid codes
por: Carruth, Nathan Thomas
Publicado: (2026)

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

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

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

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

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

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

Codes with restricted overlaps: expandability, constructions, and bounds
por: Stanovnik, Lidija
Publicado: (2024)

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

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

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

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

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

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

Decoding rank metric Reed-Muller codes
por: Couvreur, Alain, et al.
Publicado: (2025)

Block components of generalized quaternion group codes
por: Willenborg, Nadja
Publicado: (2025)

One-weight codes in the sum-rank metric
por: Mushrraf, Usman, et al.
Publicado: (2025)

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

Explicit constructions of optimal blocking sets and minimal codes
por: Bishnoi, Anurag, et al.
Publicado: (2024)

More MDS codes of non-Reed-Solomon type
por: Wu, Yansheng, et al.
Publicado: (2024)

Bounds on $k$-hash distances and rates of linear codes
por: Della Fiore, Stefano, et al.
Publicado: (2025)

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