Critical problem for codes over finite chain rings
The authors investigate the critical problem, which was introduced in matroid theory and is the problem of finding the maximum dimension of a subspace that contains no element of a fixed subset. The original problem was stated by \textit{H. H. Crapo} and \textit{G. C. Rota} [On the foundations of combinatorial theory: Combinatorial geometries. Preliminary edition. Cambridge, MA-London: The M.I.T. Press (1970; Zbl 0216.02101)]. The authors of this paper take over the critical problem to linear codes over finite fields, which means the problem of finding the critical exponent of a linear code. First, the authors introduce the critical exponent \(c(M,q)\) and give some preliminaries such like dual code, support, weight, covering number, generator matrix (in standard form) and modular independence. In Section 3 of the paper, the authors introduce the critical exponent for linear codes and they give some equivalent conditions (Theorem 3.1). Theorem 3.8 says that the critical exponent \(c(C,R)\) equals the covering number of an \(R\)-code. Among the given results, there is an extension of Kung's upper bound in Theorem 4.1. In the end of the paper, the authors give some examples.
- A generalization of Kung's theorem
- On critical exponents of Dowling matroids
- Covering radius and the chromatic number of Kneser graphs
- On the structure of linear codes with covering radius two and three
- New lower bounds for binary covering codes
- Linear binary codes with intersection properties
- Extensions of the critical theorem
- On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
- On the covering radius of binary, linear codes meeting the Griesmer bound
- Algorithms for the minimum weight of linear codes
- A generalization of Kung's theorem
- A note on the critical problem for matroids
- Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants
- Code Enumerators and Tutte Polynomials
- Codes and rings. Theory and practice
- COLOURING, PACKING AND THE CRITICAL PROBLEM
- Critical exponents, colines, and projective geometries
- Demi-matroids from codes over finite Frobenius rings
- Dowling group geometries and the critical problem
- Extensions of the critical theorem
- Generalized Hamming Weights for Almost Affine Codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 952950 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 3365297 (Why is no real title available?)
- Independence of vectors in codes over rings
- Linear Boolean Classification, Coding and the Critical Problem
- Modular independence and generator matrices for codes over \(\mathbb{Z}_m\)
- On critical exponents of Dowling matroids
- On the chromatic number of regular matroids
- On the critical exponent of transversal matroids
- On the Hamming distance of linear codes over a finite chain ring
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Some remarks on the critical problem
- A generalization of Kung's theorem
- Constructing critical indecomposable codes
- scientific article; zbMATH DE number 1867239 (Why is no real title available?)
- Critical problem for a q-analogue of polymatroids
- Recursive properties of the characteristic polynomial of weighted lattices
- Invariants of Tutte partitions and a q-analogue
This page was built for publication: Critical problem for codes over finite chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238910)
