The following pages link to Carol J. Wang (Q396897):
Displaying 20 items.
- Linked partitions and permutation tableaux (Q396898) (← links)
- Noncrossing linked partitions and large \((3,2)\)-Motzkin paths (Q427836) (← links)
- The parity of the number of permutation tableaux in a fixed shape (Q1664300) (← links)
- Wave linked partitions and 312-avoiding permutations with primacy being 1 (Q2284800) (← links)
- List decoding subspace codes from insertions and deletions (Q2826055) (← links)
- (Q2829017) (← links)
- Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes (Q2969660) (← links)
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs (Q2976856) (← links)
- (Q3015654) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- The limiting distribution of the coefficients of the 𝑞-Catalan numbers (Q3532499) (← links)
- (Q3637675) (← links)
- Maximally Recoverable Codes for Grid-like Topologies (Q4575884) (← links)
- (Q4982904) (← links)
- On the Maximum Size of Block Codes Subject to a Distance Criterion (Q5224030) (← links)
- Deletion Codes in the High-Noise and High-Rate Regimes (Q5280878) (← links)
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes (Q5346487) (← links)
- (Q5351940) (← links)
- Limitations on Testable Affine-Invariant Codes in the High-Rate Regime (Q5363048) (← links)
- Half-exceeded symmetric permutations and the inverse pairs (Q6586616) (← links)