On Rosenbloom and Tsfasman's generalization of the Hamming space

DOI10.1016/j.disc.2007.01.005zbMath1130.94021OpenAlexW2029767206MaRDI QIDQ2455578

Jörn Quistorff

Publication date: 25 October 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.01.005

zbMATH Keywords

bounds on codesgeneralization of Hamming metric

Mathematics Subject Classification ID

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

Related Items (4)

The covering problem in Rosenbloom-Tsfasman spaces ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Construction of self-dual codes in the Rosenbloom-Tsfasman metric ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• On the maximum number of permutations with given maximal or minimal distance
• Orthogonal arrays. Theory and applications
• Codes for the \(m\)-metric
• The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
• Some remarks on the Plotkin bound
• Fundamentals of coding type problems
• Fundamentals of Error-Correcting Codes
• A class of Sudan-decodable codes
• Orthogonal Arrays of Index Unity
• On perfect codes and related concepts

This page was built for publication: On Rosenbloom and Tsfasman's generalization of the Hamming space