Critical problem for codes over finite chain rings

DOI10.1016/J.FFA.2021.101900MaRDI QIDQ2238910zbMATH OpenOpenAlexFDO

Authors Koji Imamura, Keisuke Shiromoto

Publication date 2 November 2021

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2021.101900

zbMATH Keywords

critical exponentcharacteristic polynomialcodes over ringscritical problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Linear codes (general theory) (94B05)

Recommendations

• 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

Cites work

• 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?)
• A generalization of Kung's theorem
• A note on the critical problem for matroids
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• 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
• 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
• 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 Hamming distance of linear codes over a finite chain ring
• On the chromatic number of regular matroids
• On the critical exponent of transversal matroids
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

Cited in

(5)

• scientific article; zbMATH DE number 1867239 (Why is no real title available?)
• Some remarks on the critical problem
• A generalization of Kung's theorem
• Constructing critical indecomposable codes
• Critical problem for a \(q\)-analogue of polymatroids

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)