GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2roles
background 2polarities
background 2representative citing papers
Sufficient criteria are given for ambiskew polynomial rings to be differentially smooth.
citing papers explorer
-
Distinguishers for Skew and Linearized Reed-Solomon Codes
GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).
-
Noncommutative differential geometry of ambiskew polynomial rings
Sufficient criteria are given for ambiskew polynomial rings to be differentially smooth.