The covering problem for finite rings with respect to the RT-metric
DOI10.1016/j.aml.2010.04.023zbMath1193.94078OpenAlexW2000719185WikidataQ58473784 ScholiaQ58473784MaRDI QIDQ988707
Gursel Yesilot, Tevfik Bilgin, Bahattin Yildiz, Siap, Irfan
Publication date: 18 August 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.04.023
Miscellaneous applications of number theory (11Z05) Theory of error-correcting codes and error-detecting codes (94B99) Relations with coding theory (11H71) Commutative ring extensions and related topics (13B99) Group actions on combinatorial structures (05E18)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric
- A covering problem over finite rings
- Codes for the \(m\)-metric
- The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
- Linear codes over finite chain rings
- Linear codes over \({\mathbb F}_{q}[u/(u^s)\) with respect to the Rosenbloom-Tsfasman metric]
This page was built for publication: The covering problem for finite rings with respect to the RT-metric