On the Covering Dimension of a Linear Code

DOI10.1109/TIT.2016.2538768MaRDI QIDQ2976854zbMATH OpenOpenAlexFDO

Authors Thomas Britz, Keisuke Shiromoto

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/1504.02357

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid. An upper bound on the covering dimension is conjectured and nearly proven, improving a classical bound for the critical exponent. Finally, a construction is given of linear codes that attain equality in the covering dimension bound.

Cited in

(11)

• On critical exponents of Dowling matroids
• Codes with the rank metric and matroids
• Linear codes with covering radius 3
• Construction of linear covering codes
• A generalization of Kung's theorem
• Linear inequalities for covering codes. I. Pair covering inequalities
• Linear covering codes and error-correcting codes for limited-magnitude errors
• Linear inequalities for covering codes. II. Triple covering inequalities
• An improvement of the Van Wee bound for binary linear covering codes
• On the least covering radius of binary linear codes of dimension 6
• On the dimension of an APN code

This page was built for publication: On the Covering Dimension of a Linear Code

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