Results 41 to 50 of about 145 (141)
Geometric Goppa codes on Fermat curves
Le Matematiche, 2005 We consider a class of codes defined by Goppa’s algebraic-geometric construction on Fermat curves. Automorphisms and decoding of such codes are investigated.
Antonino Giorgio Spera
doaj
Isometry and automorphisms of constant dimension codes
Advances in Mathematics of Communications, 2013 We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
openaire +2 more sources
Siegel–Veech constants for cyclic covers of generic translation surfaces
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We compute the asymptotic number of cylinders, weighted by their area to any nonnegative power, on any cyclic branched cover of any generic translation surface in any stratum. Our formulae depend only on topological invariants of the cover and number‐theoretic properties of the degree: in particular, the ratio of the related Siegel–Veech ...
David Aulicino +4 more
wiley +1 more source
THEORY OF NORMAL syndrome and PLUS-decoding
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The results of the study are not primitive BCH codes with decoding the guide, the potential is much greater than the design possibilities. The efficiency of automorphisms of codes, norms theory syndromes in the correction of all admissible-Mykh minimum ...
V. A. Lipnitski, A. O. Aliaksiuk
doaj
Random planar trees and the Jacobian conjecture
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping F:Cn→Cn$F\colon \mathbb {C}^n \rightarrow \mathbb {C}^n$ whose Jacobian determinant is a non‐zero constant) has a compositional inverse which is also a polynomial. The Jacobian conjecture may be formulated in
Elia Bisi +5 more
wiley +1 more source
Annalen der Physik, Volume 537, Issue 12, December 2025.A set of particle representations, familiar from the Standard Model, collectively form a superalgebra. Those representations mirroring the behaviour of the Standard Model's gauge bosons, and three generations of fermions, are each included in this algebra, with exception only to those representations involving the top quark.
N. Furey
wiley +1 more source
Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay
IEEE Open Journal of the Communications SocietyThe anticipated demands of 6G ultra-reliable low-latency communications (URLLC) call for near-instantaneous data transfers and error-correction efficiency rivaling maximum-likelihood (ML) decoding. Achieving an effective compromise between latency, power
Anna Fominykh, Kirill Shabunov
doaj +1 more source
Hom ω$\omega$‐categories of a computad are free
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract We provide a new description of the hom functor on weak ω$\omega$‐categories, and show that it admits a left adjoint that we call the suspension functor. We then show that the hom functor preserves the property of being free on a computad, in contrast to the hom functor for strict ω$\omega$‐categories.
Thibaut Benjamin, Ioannis Markakis
wiley +1 more source
On automorphisms of geometric Goppa codes
Journal of Algebra, 1990 Let \(F/{\mathbb{F}}_ q\) be an algebraic function field of genus g, \(D=P_ 1+...+P_ n\) with pairwise distinct places \(P_ i\) of degree one, and G be another divisor of F such that \(\sup p(G)\cap \sup p(D)=\emptyset\). The geometric Goppa code associated to G and D is by definition \(C(G,D)=\{(x(P_ 1),...,x(P_ n))| x\in L(G)\}\); it is a linear code
openaire +2 more sources