Results 91 to 100 of about 7,804,605 (312)
Guess & Check Codes for Deletions and Synchronization
We consider the problem of constructing codes that can correct $\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions $(\delta=1)$ with an asymptotically ...
Hanna, Serge Kas, Rouayheb, Salim El
core +1 more source
Constructions of optimal LCD codes over large finite fields [PDF]
In this paper 1 , we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes.
Lin Sok, Minjia Shi, P. Solé
semanticscholar +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Optimal Linear Codes and Their Hulls
The hull of a linear code C is the intersection of C with its dual code. The goal is to study the dimensions of the hulls of optimal binary and ternary linear codes for a given length and dimension.
Stefka Bouyuklieva +1 more
doaj +1 more source
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem
Héctor Bombín
doaj +1 more source
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth [PDF]
Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$ parity nodes is
Min Ye, A. Barg
semanticscholar +1 more source
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Optimal noise estimation from syndrome statistics of quantum codes
Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough. To make this error correction competitive information about the specific noise is required.
Thomas Wagner +3 more
doaj +1 more source
Optimal Erasure Codes and Codes on Graphs
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several applications of our results: 1.
Yeyuan Chen +2 more
openaire +2 more sources
Optimal non-projective linear codes constructed from down-sets
By an optimal linear code we mean that it has the highest minimum distance with a prescribed length and dimension. We construct several families of optimal linear codes over the finite field F p by making use of down-sets generated by one maximal element
J. Hyun, H. Kim, Minwon Na
semanticscholar +1 more source

