5 citations · 24 across the 23 of their papers we have counts for
8 papers · 1 filter
Additive decompositions of multiplicative subgroups via differential identities
Chi Hoi Yip, Albert Cochrane, Semin Yoo
We develop a local-to-global differential framework for additive decomposition problems involving multiplicative subgroups of prime fields. Starting from Hanson--Petridis-type auxi…
Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes
Maosheng Xiong, Chi Hoi Yip, Ferdinando Zullo
Fix integers and . In this paper we study the -th generalized covering radius of the binary primitive -error-correcting BCH code $BC…
Multiplicative subgroups are not restricted sumsets
Chi Hoi Yip, Semin Yoo
We determine exactly which proper multiplicative subgroups of a prime field can be represented as a restricted sumset of the form $A\mathbin{\widehat{+}} A=\{a+a':a,a'\in A,\ a\ne…
Extensions of the Carlitz-McConnel and Blokhuis-Sziklai theorems for unions of cyclotomic classes
Maosheng Xiong, Chi Hoi Yip
Let be a prime, let , and let . A celebrated result of Carlitz and McConnel states that if is a proper subgroup of ,…
On generalized covering radii of binary primitive double-error-correcting BCH codes
Maosheng Xiong, Chi Hoi Yip
The generalized covering radii (GCR) of linear codes are a fundamental higher-dimensional extension of the classical covering radius. While the second and third GCR of binary primi…
Multiplicative irreducibility of shifted multiplicative subgroups
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
In a recent breakthrough, Kalmynin resolved conjectures of Lev--Sonn and Sárközy on additive decompositions of multiplicative subgroups of prime fields. In this paper, inspired by…
Product representations of polynomials over finite fields
Hyunwoo Lee, Chi Hoi Yip, Semin Yoo
Erdős, Sárközy, and Sós studied the asymptotics of the maximum size of a subset of such that it does not contain distinct elements whose product is a perfec…
Paley-type matrices and -factorizations of complete graphs
Chi Hoi Yip, Semin Yoo, Shikang Yu
Ball, Ortega--Moreno, and Prodromou asked two questions about whether, for every odd prime , one can find a -factor of the complete graph with some arithmetic restr…