Pages that link to "Item:Q1876077"
From MaRDI portal
The following pages link to Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions (Q1876077):
Displaying 13 items.
- Asymptotically optimal matrix codes with Hamming and rank distances (Q820933) (← links)
- Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets (Q1862991) (← links)
- Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619) (← links)
- On universally decodable matrices for space-time coding (Q2383973) (← links)
- On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric (Q2449270) (← links)
- Linear codes over \({\mathbb F}_{q}[u]/(u^s)\) with respect to the Rosenbloom-Tsfasman metric (Q2491255) (← links)
- AN ALGORITHMIC APPROACH TO ACHIEVE MINIMUM $\\rho$-DISTANCE AT LEAST d IN LINEAR ARRAY CODES (Q3515305) (← links)
- Maximum distance separable codes over ℤ2 × ℤ2s (Q4566072) (← links)
- Ordered covering arrays and upper bounds on covering codes (Q6086204) (← links)
- Niederreiter-Rosenbloom-Tsfasman LCD codes (Q6112208) (← links)
- Shape enumerators of self-dual NRT codes over finite fields (Q6644115) (← links)
- Fractional decoding and the Rosenbloom-Tsfasman metric (Q6646804) (← links)
