Imagen de Portada

Near optimal constructions of frameproof codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Miao, Ma, Zengjiao, Shangguan, Chong
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Improved upper bounds for wide-sense frameproof codes
por: Zhao, Yuhao, 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)

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

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

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

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

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

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

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

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

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

Quotients of skew polynomial rings: new constructions of division algebras and MRD codes
por: Lobillo, F. J., et al.
Publicado: (2025)

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

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

A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes
por: Harada, Masaaki
Publicado: (2024)

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

Latroids and code invariants
por: Gorla, Elisa, 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)

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)

Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)

Eigenvalue bounds and alternating rank-metric codes
por: Abiad, Aida, et al.
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)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
por: Liu, Hengfeng, et al.
Publicado: (2025)

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)

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)