On the public citation graph
On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
0 signed · 62 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0095-8956(77)90035-1openalex-snapshot
Two infinite classes of perfect codes in metrically regular graphs
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1112/plms/s2-53.2.158openalex-snapshot
On the Transformation Theory of Basic Hypergeometric Functions
inferredcites →https://doi.org/10.1137/0510092openalex-snapshot
A Set of Orthogonal Polynomials That Generalize the Racah Coefficients or $6 - j$ Symbols
inferredcites →https://doi.org/10.1137/0511008openalex-snapshot
Product Formulas for q -Hahn Polynomials
inferredcites →https://doi.org/10.1137/0513044openalex-snapshot
Orthogonal Polynomials, Duality and Association Schemes
inferredcites →https://doi.org/10.2307/2007753openalex-snapshot
An Introduction to Orthogonal Polynomials.
inferredcites →https://doi.org/10.2307/2374091openalex-snapshot
Some q-Krawtchouk Polynomials on Chevalley Groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118562819.ch6openalex-snapshot
Random Network Coding and Matroids
inferred← citeshttps://doi.org/10.1007/978-1-4613-8994-1_5openalex-snapshot
Perfect Multiple Coverings in Metric Schemes
inferred← citeshttps://doi.org/10.1007/978-94-009-0501-6_2openalex-snapshot
Orthogonal Polynomials in Coding Theory and Algebraic Combinatorics
inferred← citeshttps://doi.org/10.1007/bf01390772openalex-snapshot
Anticodes for the Grassman and bilinear forms graphs
inferred← citeshttps://doi.org/10.1007/bf01788088openalex-snapshot
On the nonexistence of nontrivial perfecte-codes and tight 2e-designs in hamming schemesH(n, q) withe ≥ 3 andq ≥ 3
inferred← citeshttps://doi.org/10.1007/bf01788104openalex-snapshot
Current research on algebraic combinatorics
inferred← citeshttps://doi.org/10.1007/bf02988310openalex-snapshot
Askey-Wilson polynomials, kernel polynomials and association schemes
inferred← citeshttps://doi.org/10.1007/bf03321065openalex-snapshot
Asymptotic Expansion of the Krawtchouk Polynomials and their Zeros
inferred← citeshttps://doi.org/10.1007/s00373-016-1739-2openalex-snapshot
Design Theory from the Viewpoint of Algebraic Combinatorics
inferred← citeshttps://doi.org/10.1007/s10623-015-0066-6openalex-snapshot
Perfect codes in Doob graphs
inferred← citeshttps://doi.org/10.1007/s10623-017-0394-9openalex-snapshot
Constructions of cyclic constant dimension codes
inferred← citeshttps://doi.org/10.1007/s10623-021-00960-xopenalex-snapshot
A family of linear codes from constant dimension subspace codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01095-3openalex-snapshot
Constructions of large cyclic constant dimension codes via Sidon spaces
inferred← citeshttps://doi.org/10.1007/s10623-023-01240-6openalex-snapshot
Characterizing subgroup perfect codes by 2-subgroups
inferred← citeshttps://doi.org/10.1007/s11005-018-1101-0openalex-snapshot
Solutions of convex Bethe Ansatz equations and the zeros of (basic) hypergeometric orthogonal polynomials
inferred← citeshttps://doi.org/10.1007/s11401-006-0195-3openalex-snapshot
Global Asymptotics of Krawtchouk Polynomials – a Riemann-Hilbert Approach*
inferred← citeshttps://doi.org/10.1007/s11464-022-1011-4openalex-snapshot
Constructions of Sidon spaces and cyclic subspace codes
inferred← citeshttps://doi.org/10.1007/s12095-020-00463-xopenalex-snapshot
Further constructions of cyclic subspace codes
inferred← citeshttps://doi.org/10.1007/s12095-024-00749-4openalex-snapshot
Three families of large cyclic subspace codes
inferred← citeshttps://doi.org/10.1007/s40314-023-02353-3openalex-snapshot
New constructions of Sidon spaces and large cyclic constant dimension codes
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90188-9openalex-snapshot
An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms
inferred← citeshttps://doi.org/10.1016/0021-9045(90)90072-xopenalex-snapshot
Zeros of generalized Krawtchouk polynomials
inferred← citeshttps://doi.org/10.1016/0022-247x(92)90300-3openalex-snapshot
New results involving a certain class of q-orthogonal polynomials
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.042openalex-snapshot
Classification of perfect and total perfect codes in generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2012.08.010openalex-snapshot
Linearity and complements in projective space
inferred← citeshttps://doi.org/10.1016/j.laa.2022.12.011openalex-snapshot
Further constructions of large cyclic subspace codes via Sidon spaces
inferred← citeshttps://doi.org/10.1016/s0378-3758(99)00126-3openalex-snapshot
Tight 2-designs and perfect 1-codes in Doob graphs
inferred← citeshttps://doi.org/10.1090/proc/14625openalex-snapshot
Gradient system for the roots of the Askey-Wilson polynomial
inferred← citeshttps://doi.org/10.1090/s0894-0347-1990-1030655-4openalex-snapshot
Efficient Computation of the Fourier Transform on Finite Groups
inferred← citeshttps://doi.org/10.1109/isit.2007.4557321openalex-snapshot
Coding for Errors and Erasures in Random Network Coding
inferred← citeshttps://doi.org/10.1109/isit.2008.4595111openalex-snapshot
Error-Correcting Codes in Projective Space
inferred← citeshttps://doi.org/10.1109/isit.2014.6875262openalex-snapshot
Perfect permutation codes with the Kendall's τ-metric
inferred← citeshttps://doi.org/10.1109/sahcnw.2008.27openalex-snapshot
Constant-Rank Codes and Their Connection to Constant-Dimension Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.926449openalex-snapshot
Coding for Errors and Erasures in Random Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2010.2048447openalex-snapshot
Constant-Rank Codes and Their Connection to Constant-Dimension Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2095232openalex-snapshot
Error-Correcting Codes in Projective Space
inferred← citeshttps://doi.org/10.1109/tit.2013.2244032openalex-snapshot
Localized Error Correction in Projective Space
inferred← citeshttps://doi.org/10.1109/tit.2015.2424701openalex-snapshot
Bounds on the Size of Permutation Codes With the Kendall $\tau $ -Metric
inferred← citeshttps://doi.org/10.1109/tit.2016.2520479openalex-snapshot
Subspace Polynomials and Cyclic Subspace Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2946612openalex-snapshot
The Existence of Perfect Codes in Doob Graphs
inferred← citeshttps://doi.org/10.1137/19m1258013openalex-snapshot
Subgroup Perfect Codes in Cayley Graphs
inferred← citeshttps://doi.org/10.1142/s0219498825410117openalex-snapshot
Eigenvalue bounds and alternating rank-metric codes
inferred← citeshttps://doi.org/10.37236/10083openalex-snapshot
Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii
inferred← citeshttps://doi.org/10.48550/arxiv.0803.2262openalex-snapshot
Constant-Rank Codes and Their Connection to Constant-Dimension Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1103.3117openalex-snapshot
Linearity and Complements in Projective Space
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6126openalex-snapshot
Problems on q-Analogs in Coding Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1404.7739openalex-snapshot
Subspace Polynomials and Cyclic Subspace Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0703061openalex-snapshot
Coding for Errors and Erasures in Random Network Coding
inferred← citeshttps://doi.org/10.48550/arxiv.math/9602214openalex-snapshot
The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue
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.