I’m trying to understand the implementation of the publicKey on CKKS.
When I go to the code, I have a problem to understand the DGG.
OpenFHE use DiscreteGaussianGeneratorImpl<VecType>::GenerateIntVector
to get a seed, then use static_cast<int64_t>(FindInVector(m_vals, tmp)) * (seed > 0 ? 1 : 1);
, etc, etc, etc.

Ignoring security reason, we can mainly said that it simple sample a gaussian distribution vector with values from 3.19 to 3.19, and then apply an NTT?

Another at
openfhedevelopment/src/pke/lib/schemerns/rnspke.cpp
,
When encrypting with public key with a secret key with gaussian distribution, e0, e1 and v are all sample from a gaussian with std = 3.19? 
And I add another one:
When we are creating the public key, basically we make pk = (e a*s, a).
When implementing it, this two things are analogous?
a) Sample one a from an uniform distribution mod Q, and then mapped to an RNS form.
b) Sample each limb individually form an uniform distribution mod qi