On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes

DOI10.1109/TIT.2015.2389248MaRDI QIDQ2978721zbMATH OpenFDO

Authors

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7771

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Let $mathcalC=(C_1,C_2,ldots)$ be a sequence of codes such that each $C_i$ is a linear $[n_i,k_i,d_i]$-code over some fixed finite field $mathbbF$, where $n_i$ is the length of the codewords, $k_i$ is the dimension, and $d_i$ is the minimum distance. We say that $mathcalC$ is asymptotically good if, for some $varepsilon>0$ and for all $i$, $n_{i}geqi$, $k_i/n_{i}geqvarepsilon$, and $d_i/n_{i}geqvarepsilon$. Sequences of asymptotically good codes exist. We prove that if $mathcalC$ is a class of GF$(p^n)$-linear codes (where $p$ is prime and $ngeq1$), closed under puncturing and shortening, and if $mathcalC$ contains an asymptotically good sequence, then $mathcalC$ must contain all GF$(p)$-linear codes. Our proof relies on a powerful new result from matroid structure theory.

Cited in

(2)

• On perturbations of highly connected dyadic matroids
• Random shortening of linear codes and applications

This page was built for publication: On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978721)