On the public citation graph

The Covering Problem in Rosenbloom-Tsfasman Spaces

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/sapm199082159openalex-snapshot
Hyper‐rook Domain Inequalities
inferredcites →https://doi.org/10.1007/bf01294651openalex-snapshot
Point sets and sequences with small discrepancy
inferredcites →https://doi.org/10.1007/s10623-008-9204-8openalex-snapshot
Maximum distance separable poset codes
inferredcites →https://doi.org/10.1016/0012-365x(85)90152-9openalex-snapshot
On covering and coloring problems for rook domains
inferredcites →https://doi.org/10.1016/0012-365x(94)00228-bopenalex-snapshot
Codes with a poset metric
inferredcites →https://doi.org/10.1016/0097-3165(84)90010-4openalex-snapshot
More coverings by rook domains
inferredcites →https://doi.org/10.1016/j.aml.2010.04.023openalex-snapshot
The covering problem for finite rings with respect to the RT-metric
inferredcites →https://doi.org/10.1016/j.disc.2007.01.005openalex-snapshot
On Rosenbloom and Tsfasman's generalization of the Hamming space
inferredcites →https://doi.org/10.1016/j.jcta.2008.06.008openalex-snapshot
Lower bounds on covering codes via partition matrices
inferredcites →https://doi.org/10.1016/j.laa.2013.11.034openalex-snapshot
Invariant sets under linear operator and covering codes over modules
inferredcites →https://doi.org/10.1016/s0021-9800(70)80018-7openalex-snapshot
Coverings by rook domains
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1023/a:1020834531372openalex-snapshot
Maximum Distance Separable Codes in the ρ Metric over Arbitrary Alphabets
inferredcites →https://doi.org/10.1109/18.54887openalex-snapshot
Lower bounds for q-ary covering codes
inferredcites →https://doi.org/10.1109/allerton.2010.5706929openalex-snapshot
Linear ordered codes, shape enumarators and parallel channels
inferredcites →https://doi.org/10.1109/isit.2010.5513736openalex-snapshot
Near MDS poset codes and distributions
inferredcites →https://doi.org/10.1109/tit.1964.1053661openalex-snapshot
Maximum distanceq-nary codes
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.60openalex-snapshot
A Combinatorial Problem in Matching
inferredcites →https://doi.org/10.1112/jlms/s2-1.1.493openalex-snapshot
Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
inferredcites →https://doi.org/10.3934/amc.2008.2.95openalex-snapshot
Error-block codes and poset metrics
inferredcites →https://doi.org/10.48550/arxiv.math/9909163openalex-snapshot
Coding Theory and Uniform Distributions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcd.21882openalex-snapshot
Ordered covering arrays and upper bounds on covering codes
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_9openalex-snapshot
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-93821-9_4openalex-snapshot
Disjoint Chains with Equal Length: The Niederreiter-Rosenbloom-Tsfasman Metric
inferred← citeshttps://doi.org/10.1007/s12190-024-02288-wopenalex-snapshot
On the number of ideals of the Niederreiter–Rosenbloom–Tsfasman poset and lower bounds on covering codes
inferred← citeshttps://doi.org/10.1007/s40314-019-0828-2openalex-snapshot
Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom–Tsfasman space
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653994openalex-snapshot
List Decoding of Hyperderivative Reed-Solomon Codes under NRT-metric
inferred← citeshttps://doi.org/10.1109/tit.2020.2983710openalex-snapshot
General Approach to Poset and Additive Metrics
inferred← citeshttps://doi.org/10.1109/tit.2023.3340664openalex-snapshot
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric
inferred← citeshttps://doi.org/10.17771/pucrio.acad.34169openalex-snapshot
MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM
inferred← citeshttps://doi.org/10.3934/amc.2022065openalex-snapshot
Niederreiter-Rosenbloom-Tsfasman LCD codes
inferred← citeshttps://doi.org/10.3934/amc.2023001openalex-snapshot
On covering problems in hierarchical poset spaces
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.