Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
From MaRDI portal
Publication:1876077
DOI10.1023/B:DESI.0000032606.11770.89zbMath1054.94019MaRDI QIDQ1876077
Steven T. Dougherty, Shiromoto, Keisuke
Publication date: 16 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Related Items (5)
On universally decodable matrices for space-time coding ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Niederreiter-Rosenbloom-Tsfasman LCD 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]
This page was built for publication: Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions