A Topological View of Reed–Solomon Codes

We studied a particular class of well known error-correcting codes known as Reed–Solomon codes. We constructed RS codes as algebraic-geometric codes from the normal rational curve. This approach allowed us to study some algebraic representations of RS codes through the study of the general linear group GL(n,q). We characterized the coefficients that appear in the decompostion of an irreducible representation of the special linear group in terms of Gromov–Witten invariants of the Hilbert scheme of points in the plane. In addition, we classified all the algebraic codes defined over the normal rational curve, thereby providing an algorithm to compute a set of generators of the ideal associated with any algebraic code constructed on the rational normal curve (NRC) over an extension Fqn of Fq.

Light from Schwarzschild black holes in de Sitter expanding universe

A new method is applied for deriving simultaneously the redshift and shadow of a Schwarzschild black hole moving freely in the de Sitter expanding universe as recorded by a remote co-moving observer. This method is mainly algebraic, focusing on the transformation of the conserved quantities under the de Sitter isometry relating the black hole co-moving frame to observer’s one. Hereby one extracts the general expressions of the redshifts and shadows of the black holes having peculiar velocities but their expressions are too extended to be written down here. Therefore, only some particular cases and intuitive expansions are presented while the complete results are given in an algebraic code (Cotăescu in Maple code BH01, https://physics.uvt.ro/~cota/CCFT/codes, 2020).

Developing Bid-Ask Probabilities for High-Frequency Trading

Methods of path integrals are used to develop multi-factor probabilities of bid-ask variables to be used in high-frequency trading (HFT). Adaptive Simulated Annealing (ASA) is used to fit the nonlinear forms, so developed to a day of BitMEX tick data. Maxima algebraic code is used to develop the path integral codes into C codes, and a sampling code is used for the fitting process. After these fits, the resultant C code is very fast and useful for forecasting upcoming ‘ask’, bid, midprice, etc., when narrow and wide windows of incoming data are used. A bonus is the availability of canonical momenta indicators (CMI) useful to forecast direction and strengths of these variables.

The Genetic Code, Algebraic Codes and Double Numbers

The article shows materials to the question about algebraic features of the genetic code and about the dictatorial influence of the DNA and RNA molecules on the whole organism. Presented results testify in favor that the genetic code is an algebraic code related with a wide class of algebraic codes, which are a basis of noise-immune coding of information in communication technologies. Structural features of the genetic systems are associated with hypercomplex double (or hyperbolic) numbers and with bisymmetric doubly stochastic matrices. The received results confirm that represented matrix approaches are effective for modeling genetic phenomena and revealing the interconnections of structures of biological bodies at various levels of their organization. This allows one to think that living organisms are algebraically encoded entities where structures of genetic molecules have the dictatorial influence on inherited structures of the whole organism. New described algebraic approaches and results are discussed.

The Genetic Code, Algebraic Codes and Double Numbers

The article shows materials to the question on algebraic features of the genetic code. Presented results testify in favor that the genetic code is an algebraic code related with a wide class of algebraic codes, which are a basis of noise-immune coding of information in communication technologies. Algebraic features of the genetic code are associated with hypercomplex double (or hyperbolic) numbers. The article also presents data on structural relations of some genetically inherited macrobiological phenomena with double numbers and with their algebraic extentions. The received results confirm that multidimensional numerical systems is effective for modeling and revealing the interconnections of structures of biological bodies at various levels of their organization. This allows one to think that living organisms are algebraically encoded entities.

Developing Bid-Ask Probabilities for High-Frequency Trading

Methods of path integrals are used to develop multi-factor probabilities of bid-ask variables for use in high-frequency trading (HFT). Adaptive Simulated Annealing (ASA) is used to fit the nonlinear forms so developed to a day of BitMEX tick data. Maxima algebraic code is used to develop the path integral codes into C codes, and sampling code is used for the fitting process. After these fits, the resultant C code is very fast and useful for forecasting upcoming ask, bid, midprice, etc., when narrow and wide windows of incoming data are used. A bonus is the availability of canonical momenta indicators (CMI) useful to forecast direction and strengths of these variables.

Developing Bid-Ask Probabilities for High-Frequency Trading

Methods of path integrals are used to develop multi-factor probabilities of bid-ask variables for use in high-frequency trading (HFT). Adaptive Simulated Annealing (ASA) is used to fit the nonlinear forms so developed to a day of BitMEX tick data. Maxima algebraic code is used to develop the path integral codes into C codes, and sampling code is used for the fitting process. After these fits, the resultant C code is very fast and useful for forecasting upcoming ask, bid, midprice, etc., when narrow and wide windows of incoming data are used. A bonus is the availability of canonical momenta indicators (CMI) useful to forecast direction and strengths of these variables.

Efficient statistics-based algebraic codebook search algorithms derived from RCM for an ACELP speech coder

Applied to analgebraic codebook search conducted on an algebraic code-excitedlinear-prediction (ACELP) speech coder, two improved versions of reducedcandidate mechanism (RCM), designated as Fixed-G1-RCM and Fixed-2Track-RCM, arepresented in this study for further search performance improvement. It ismainly derived from two major research findings in a piece of our prior work.The first finding is that a pulse with a high contribution in a track is morelikely to serve as the optimal pulse in the optimal vector pertaining to thetrack, and the second is that the speech quality can be well maintained at asearch accuracy above 50%. In this proposal, the trade off can be tuned betweenthe search accuracy and the search complexity so as to reach a nearlyconsistent speech quality. It is experimentally demonstrated that either Fixed-G1-RCM(N = 3), or Fixed-2Track-RCM (M = 2, N = 3, or M = 3, N = 4) can provide ahighly superior search performance relative to a global pulse replacementmethod (iteration = 2) and an iteration-freepulse replacement method.DOI: http://dx.doi.org/10.5755/j01.itc.44.4.9847