:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Stanovnik, Lidija
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory Combinatorics
Acceso en línea:	https://arxiv.org/abs/2411.02899
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

In search of maximum non-overlapping codes
por: Stanovnik, Lidija, et al.
Publicado: (2023)

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

An exposition of recent list-size bounds of FRS Codes
por: Garg, Abhibhav, et al.
Publicado: (2025)

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

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

A classification of overlapping clustering schemes for hypergraphs
por: Agdur, Vilhelm
Publicado: (2024)

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)

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

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

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

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

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
por: Hollmann, Henk D. L., et al.
Publicado: (2024)

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

Schubert Subspace Codes
por: Alfarano, Gianira N., et al.
Publicado: (2024)

Bounds on Box Codes
por: Langberg, Michael, et al.
Publicado: (2025)

Polynomials, Divided Differences, and Codes
por: Venkitesh, S.
Publicado: (2024)

The Eigenvalue Method in Coding Theory
por: Abiad, Aida, et al.
Publicado: (2025)

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

$t$-Balanced Codes with the Kendall-$τ$ Metric
por: Jany, Benjamin, et al.
Publicado: (2024)

Intersecting Codes and the Connectivity of $q$-Matroids
por: Conca, Fabrizio, et al.
Publicado: (2026)

The Service Rate Region of Hamming Codes
por: Choudhary, Priyanka, et al.
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)

The Geometry of Codes for Random Access in DNA Storage
por: Gruica, Anina, et al.
Publicado: (2024)

A Survey on Codes from Simplicial Complexes
por: Wu, Yansheng, et al.
Publicado: (2024)

Maximal Recoverability: A Nexus of Coding Theory
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Binary Caps and LCD Codes with Large Dimensions
por: Ishizuka, Keita, et al.
Publicado: (2026)

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

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
por: Cotardo, Giuseppe, et al.
Publicado: (2024)

The Support Designs of Several Families of Lifted Linear Codes
por: Ding, Cunsheng, et al.
Publicado: (2024)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
por: Yu, Wenjun, et al.
Publicado: (2024)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
por: Berend, Hagai, et al.
Publicado: (2025)

Improved Johnson-type Bounds for Insertion-Deletion Codes
por: Yang, Yulin
Publicado: (2026)

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

Polynomial Invariants of q-Matroids and Rank-Metric Codes
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)

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

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
por: Wei, Hengjia, et al.
Publicado: (2024)

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