Papers by Jirapa Limbupasiriporn
Applicable Algebra in Engineering, Communication and Computing, 2013
The generalized Paley graphs GP(q, k) are a generalization of the wellknown Paley graphs. Codes d... more The generalized Paley graphs GP(q, k) are a generalization of the wellknown Paley graphs. Codes derived from the row span of adjacency and incidence matrices from Paley graphs have been studied in Ghinellie and Key (Adv Math Commun 5(1):93-108, 2011) and Key and Limbupasiriporn (Congr Numer 170:143-155, 2004). We examine the binary codes associated with the incidence designs of the generalized Paley graphs obtaining the code parameters [ qs 2 , q -1, s] or [qs, q -1, 2s] where s = q-1 k . By finding explicit PD-sets we show that these codes can be used for permutation decoding.
Applicable Algebra in Engineering, Communication and Computing, 2013
The generalized Paley graphs GP(q, k) are a generalization of the wellknown Paley graphs. Codes d... more The generalized Paley graphs GP(q, k) are a generalization of the wellknown Paley graphs. Codes derived from the row span of adjacency and incidence matrices from Paley graphs have been studied in Ghinellie and Key (Adv Math Commun 5(1):93-108, 2011) and Key and Limbupasiriporn (Congr Numer 170:143-155, 2004). We examine the binary codes associated with the incidence designs of the generalized Paley graphs obtaining the code parameters [ qs 2 , q − 1, s] or [qs, q − 1, 2s] where s = q−1 k. By finding explicit PD-sets we show that these codes can be used for permutation decoding.
Uploads
Papers by Jirapa Limbupasiriporn