On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics

DOI10.1016/j.jco.2007.02.004zbMath1134.94388MaRDI QIDQ2465826

Maxim M. Skriganov

Publication date: 9 January 2008

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2007.02.004

zbMATH Keywords

coding theory with non-Hamming metrics

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

Related Items

Unnamed Item, Repeated-root constacyclic codes of length $2p^s$ over Galois rings, RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u], On structure and distances of some classes of repeated-root constacyclic codes over Galois rings, MacWilliams extension theorems and the local-global property for codes over Frobenius rings, On mean values of the $L_q$-discrepancies of point distributions, Extension theorems for various weight functions over Frobenius bimodules

Cites Work

• Low-discrepancy sequences and global function fields with many rational places
• Codes for the \(m\)-metric
• The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
• Explicit constructions in the classical mean squares problem in irregularities of point distribution
• Harmonic analysis on totally disconnected groups and irregularities of point distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item