The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)

DOI10.1016/S0893-9659(04)90013-4zbMath1043.94019OpenAlexW2043854603WikidataQ58473872 ScholiaQ58473872MaRDI QIDQ1433236

Siap, Irfan, Mehmet Ozen

Publication date: 15 June 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(04)90013-4

zbMATH Keywords

matricescodes over ringscomplete weight enumeratornon-Hamming metric

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (5)

RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ Cyclic codes over \(\mathbb F_2[u/(u^4-1)\) and applications to DNA codes] ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ Linear codes over \({\mathbb F}_{q}[u/(u^s)\) with respect to the Rosenbloom-Tsfasman metric] ⋮ The covering problem for finite rings with respect to the RT-metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes for the \(m\)-metric
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• The Complete Weight Enumerator for Codes over M nxs(F q)

This page was built for publication: The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)