Reproduce “Rank-metric intersecting codes” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Martino Borello, Martin Scotti, Lune Vila

The authors characterize row-intersecting matrix codes, where every pair of nonzero matrices has row spaces that meet nontrivially. For general codes, they relate this property to indecomposability of a generator tensor’s third slice space; for matrix algebras, it is equivalent to the socle being row-intersecting. They prove the sharp bound n ≤ 2m−1 for column-nondegenerate codes and give a binary [5×5,3,2] algebra that fails the sufficient distance test 2d > n yet remains row-intersecting.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.