Results 41 to 50 of about 5,176 (95)

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  

Error-correcting codes for fermionic quantum simulation

SciPost Physics
Utilizing the framework of $\mathbb{Z}_2$ lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms
Yu-An Chen, Alexey V. Gorshkov, Yijia Xu
doaj   +1 more source

The flat cover conjecture for monoid acts

Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.
Abstract We prove that the Flat Cover Conjecture holds for the category of (right) acts over any right‐reversible monoid S$S$, provided that the flat S$S$‐acts are closed under stable Rees extensions. The argument shows that the class F$\mathcal {F}$‐Mono (S$S$‐act monomorphisms with flat Rees quotient) is cofibrantly generated in such categories ...
Sean Cox
wiley   +1 more source

Steiner t-designs for large t

, 2008
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L.
A. Betten, A. Delandtsheer, D. Gorenstein, D. Livingstone, D. Pei, D.G. Higman, D.K. Ray-Chaudhuri, D.R. Hughes, D.R. Stinson, D.R. Stinson, F. Buekenhout, F. Buekenhout, G.-C. Rota, H. Lüneburg, H. Wielandt, J. Saxl, J. Tits, J.D. Dixon, J.H. Conway, L. Teirlinck, M. Hall Jr., M. Huber, M. Huber, M. Huber, M. Huber, M.W. Liebeck, M.W. Liebeck, N.D. Tuan, P. Dembowski, P. Kaski, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, R.A. Fisher, R.E. Block, T.. Beth, W.C. Huffman, W.M. Kantor, W.M. Kantor   +40 more
core   +2 more sources

Computing the bridge length: the key ingredient in a continuous isometry classification of periodic point sets

Acta Crystallographica Section A, Volume 81, Issue 6, Page 427-437, November 2025.
We describe an efficient algorithm to compute the bridge length estimating the size of a complete isoset invariant, which classifies all periodic point sets under Euclidean motion.The fundamental model of any periodic crystal is a periodic set of points at all atomic centres.
Jonathan McManus, Vitaliy Kurlin
wiley   +1 more source

Indiscernibles in monadically NIP theories

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3326-3345, November 2025.
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
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  

Asymmetric graphs with quantum symmetry

Proceedings of the London Mathematical Society, Volume 131, Issue 5, November 2025.
Abstract We present an infinite sequence of finite graphs with trivial automorphism group and non‐trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are the first examples of any asymmetric classical space that has non‐trivial quantum symmetries.
Josse van Dobben de Bruyn, David E. Roberson, Simon Schmidt   +2 more
wiley   +1 more source

Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay

IEEE Open Journal of the Communications Society
The 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