On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric

DOI10.1155/2014/237915zbMath1332.94109OpenAlexW2037408904WikidataQ59047617 ScholiaQ59047617MaRDI QIDQ2449270

Venkatrajam Marka, R. S. Selvaraj

Publication date: 7 May 2014

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/237915

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Covering radius 1985-1994
• The covering problem for finite rings with respect to the RT-metric
• Codes for the \(m\)-metric
• The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• CT bursts-from classical to array coding
• On normal and subnormal q-ary codes
• On the covering radius of codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• Four fundamental parameters of a code and their combinatorial significance

This page was built for publication: On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric