:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Willenborg, Nadja
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics
Online Access:	https://arxiv.org/abs/2501.01502
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Outer Strong Blocking Sets
by: Alfarano, Gianira N., et al.
Published: (2023)

Additive codes from linear codes
by: Ball, Simeon, et al.
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)

Error-detecting solid codes
by: Carruth, Nathan Thomas
Published: (2026)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

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

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, et al.
Published: (2026)

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

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

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

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

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)

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

The generalized trifference problem
by: Bishnoi, Anurag, et al.
Published: (2025)

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

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

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

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

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)

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

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

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

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)

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

On the non-existence of perfect codes in the sum-rank metric
by: Del Prete, Giuseppe, et al.
Published: (2025)

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

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

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

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

A generalization of Boppana's entropy inequality
by: Ho, Boon Suan
Published: (2026)

The asymptotic number of equivalence classes of linear codes with given dimension
by: Di Giusto, Andrea, et al.
Published: (2025)

Clubs in projective spaces and three-weight rank-metric codes
by: Mannaert, Jonathan, et al.
Published: (2025)

On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)

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