Cover Image

Codes with restricted overlaps: expandability, constructions, and bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Stanovnik, Lidija
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

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

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

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

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

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

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

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

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

A classification of overlapping clustering schemes for hypergraphs
by: Agdur, Vilhelm
Published: (2024)

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

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

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

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

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

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

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

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

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
by: Bao, Jingjun, et al.
Published: (2026)