alphaFeedback

WorksMathematics

On the MDS conjecture in even characteristic

Abstract

We prove that every nontrivial linear [n,k][n,k] maximum distance separable (MDS) code over a finite field \F_q of characteristic two satisfies n≤q+1n\le q+1, except in dimensions k=3k=3 and k=q−1k=q-1, where n≤q+2n\le q+2. This resolves the linear MDS conjecture in even characteristic.

Paper details

vlnc:W_vs6fnkgj
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

arXiv nonexclusive license

Original source

  • Mathematics

ChatGPT · View statement →

Looking for related papers…