The covering problem in Rosenbloom-Tsfasman spaces
From MaRDI portal
Publication:888588
zbMath1358.94104MaRDI QIDQ888588
Emerson L. Monte Carmelo, André Guerino Castoldi
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p30
Related Items
Ordered covering arrays and upper bounds on covering codes, Niederreiter-Rosenbloom-Tsfasman LCD codes, 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
- Unnamed Item
- Point sets and sequences with small discrepancy
- More coverings by rook domains
- Error-block codes and poset metrics
- The covering problem for finite rings with respect to the RT-metric
- Lower bounds on covering codes via partition matrices
- Maximum distance separable poset codes
- On covering and coloring problems for rook domains
- Codes for the \(m\)-metric
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- Codes with a poset metric
- Invariant sets under linear operator and covering codes over modules
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- Hyper-rook Domain Inequalities
- Lower bounds for q-ary covering codes
- Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
- A Combinatorial Problem in Matching
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- Coverings by rook domains
- Maximum distance<tex>q</tex>-nary codes
