Results 41 to 50 of about 16,644 (310)
, 1995 Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990)
Krasikov, I +3 more
core +1 more source
On Stronger Types of Locating-dominating Codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead to ...
Ville Junnila +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Linear programming bounds for doubly-even self-dual codes
, 1997 Using a variant of linear programming method we derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives d/n
Krasikov, I, Simon Litsyn, Ilia Krasikov
core +1 more source
Constructions and bounds on linear error-block codes
, 2007 We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes ...
Özbudak, Ferruh, Ling, San
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
An improved upper bound on the minimum distance of doubly-even self-dual codes
, 2000 We derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives limn→∞ sup d/n
Krasikov, I, Litsyn, S
core +1 more source
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes [PDF]
, 2008 We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree ...
Urbanke, Ruediger +3 more
core +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
From Product Codes to Structured Generalized LDPC Codes
, 2010 Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors.
Paolini, Enrico +10 more
core +1 more source