Results 71 to 80 of about 7,804,605 (312)
THE CONVOLUTIONAL CODESАNALYSIS TECHNIQUE ON THE OPTIMUM BLOCK CODES GROUNDS
Information and Telecommunication Sciences, 2014 The convolutional codes analysis and synthesis technique is proposed. This technique is optimal according to near Shannon's bound criterion and guarantees a given bit error rate from message source.
Leonid Uryvskyi +2 more
doaj +1 more source
Optimal Locally Repairable Linear Codes [PDF]
, 2013 Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum Hamming distance ...
Dau, Son Hoang +3 more
core
IEEE Transactions on Information Theory, 2019 The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed–Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the ...
Itzhak Tamo, Min Ye, A. Barg
semanticscholar +1 more source
Optimal Document Exchange and New Codes for Insertions and Deletions [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We give the first communication-optimal document exchange protocol. For any n and k < n our randomized scheme takes any n-bit file F and computes a Θ(k log n/k) -bit summary from which one can reconstruct F, with high probability, given a related file F'
Bernhard Haeupler
semanticscholar +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
IEEE Access, 2019 In a distributed storage system, regenerating codes can be utilized to ensure data availability. This reduces the repair bandwidth but increases the risk of data eavesdropping on each node.
Jianchao Bian +3 more
doaj +1 more source
Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication
Mathematics, 2020 It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical ...
Yansheng Wu, Yoonjin Lee
doaj +1 more source
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes
2022 IEEE International Symposium on Information Theory (ISIT), 2022 The theory of multichannel prefix codes aims to generalize the classical theory of prefix codes. Although single- and two-channel prefix codes always have decoding trees, the same cannot be said when there are more than two channels. One question is of theoretical interest: Do there exist optimal tree-decodable codes that are not optimal prefix codes ...
Hoover H. F. Yin +3 more
openaire +2 more sources
Constructions of Optimal and Almost Optimal Locally Repairable Codes
, 2014 Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I.
Ernvall, Toni +2 more
core +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source