Results 31 to 40 of about 279 (76)
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing.
Helmling, Michael +2 more
core +1 more source
Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is still a considerable gap between the performance of the BP decoder and the ...
Jäkel, Holger +2 more
core
Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions
Physical unclonable functions (PUFs) involve challenging practical applications of error-correcting codes (ECCs), requiring extremely low failure rates on the order of $10^{-6}$ and below despite raw input bit error rates as high as 22%. These requirements call for an efficient ultra-low rate code design.
Rübenacke, Marvin +3 more
openaire +2 more sources
Ergodic Classical-Quantum Channels: Structure and Coding Theorems
We consider ergodic causal classical-quantum channels (cq-channels) which additionally have a decaying input memory. In the first part we develop some structural properties of ergodic cq-channels and provide equivalent conditions for ergodicity.
Bjelakovic, Igor, Boche, Holger
core +2 more sources
Thermal states are vital: Entanglement Wedge Reconstruction from Operator-Pushing [PDF]
We give a general construction of a setup that verifies bulk reconstruction, conservation of relative entropies, and equality of modular flows between the bulk and the boundary, for infinite-dimensional systems with operator-pushing. In our setup, a bulk-
Gesteau, Elliott, Kang, Monica Jinwoo
core +1 more source
GPU-Accelerated Automorphism Ensemble Decoding of Quantum LDPC Codes
Quantum computers promise breakthroughs on problems that are intractable for even the most powerful supercomputers. However, the building blocks of quantum computers, qubits, are fragile and susceptible to noise, which corrupts calculations. Quantum Error Correction (QEC) allows us to bypass those issues, but it requires fast and accurate classical ...
Stergios Koutsioumpas, Joschka Roffe
openaire +1 more source
Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density parity-check (LDPC) codes, and are well investigated in ...
Banihashemi, Amir H., Dehghan, Ali
core +1 more source
A Low-Latency and High-Performance SCL Decoder with Frame-Interleaving [PDF]
In this paper, we describe a frame-interleaving hardware architecture for a generalized node-based successive cancellation list (SCL) decoder. By efficiently reusing otherwise idle computational units, two independent frames can be decoded simultaneously,
Balatsoukas-Stimming, Alexios +6 more
core +1 more source
Math Ontological Basis of Quasi Fine-Tuning in Ghc Cosmologies [PDF]
The subject of fine tuning in physics is a long contentious issue especially now as it has hitched a ride on the Multiverse bandwagon. The maths of quadratic forms are predominately featured and relate the physics parameters G h c, which in turn are ...
Thomas, Mark
core +1 more source
A new efficient decoder of linear block codes based on ensemble learning methods [PDF]
Error-correcting codes are used to partially or completely correct errors as much as possible, while ensuring high transmission speeds. Several machine learning models such as logistic regression and decision tree have been applied to correct ...
Aylaj, Bouchaib +5 more
core +2 more sources

