Somphong Jitman

activity

20092026

most citedCSS-like Constructions of Asymmetric Quantum Codes

53 citations · 148 across the 30 of their papers we have counts for

collaborators

Showing math.NTShow all

4 papers · 1 filter

math.NT2026

Good Integers: (T,k)-Subclasses and Applications to Galois Duality in Coding Theory

Somphong Jitman, Panthakan Boonsuriyatham

The notion of good integers, namely the divisors of the sequence $(a^{s} + b^{s})_{s \geq 1}$ for nonzero coprime integers $a$ and $b$ , together with their subfamilies such as oddly-good a…

math.NT2025

Good Integers: A Concise Completion of the Non-Coprime Case

Somphong Jitman

For coprime nonzero integers $a$ and $b$ , a positive integer $ℓ$ is said to be {\em good} with respect to $a$ and $b$ if there exists a positive integer $k$ such that $\ell |(a^…

math.NT2025

Good Integers: A Comprehensive Review with Applications

Somphong Jitman

For nonzero coprime integers $a$ and $b$ , a positive integer $ℓ$ is said to be \emph{good with respect to $a$ and $b$ } if there exists a positive integer $k$ such that $ℓ$ di…

math.NT2020

Revisiting the Factorization of $x^{n} + 1$ over Finite Fields

Arunwan Boripan, Somphong Jitman

The polynomial $x^{n} + 1$ over finite fields has been of interest due to its applications in the study of negacyclic codes over finite fields. In this paper, a rigorous treatment of t…

Good Integers: (T,k)-Subclasses and Applications to Galois Duality in Coding Theory

Good Integers: A Concise Completion of the Non-Coprime Case

Good Integers: A Comprehensive Review with Applications

Revisiting the Factorization of xn+1 over Finite Fields

Revisiting the Factorization of $x^{n} + 1$ over Finite Fields