Critical problem for codes over finite chain rings

DOI10.1016/j.ffa.2021.101900zbMath1482.94079OpenAlexW3195369944MaRDI QIDQ2238910

Koji Imamura, Shiromoto, Keisuke

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Kung's theorem
• On the critical exponent of transversal matroids
• Characterizations of \(\text{PG}(n-1,q)\setminus\text{PG}(k-1,q)\) by numerical and polynomial invariants
• A note on the critical problem for matroids
• Modular independence and generator matrices for codes over \(\mathbb{Z}_m\)
• Independence of vectors in codes over rings
• Dowling group geometries and the critical problem
• On the chromatic number of regular matroids
• On critical exponents of Dowling matroids
• Demi-matroids from codes over finite Frobenius rings
• Extensions of the critical theorem
• Critical Exponents, Colines, and Projective Geometries
• Linear Boolean Classification, Coding and the Critical Problem
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• On the Hamming distance of linear codes over a finite chain ring
• Generalized Hamming Weights for Almost Affine Codes
• Code Enumerators and Tutte Polynomials

This page was built for publication: Critical problem for codes over finite chain rings